Travelled to:1 × Austria
1 × Canada
1 × Croatia
1 × Czech Republic
1 × Greece
1 × Italy
1 × USA
2 × Denmark
2 × Germany
2 × Japan
3 × France
Collaborated with:∅ A.Kucera W.Czerwinski J.Srba J.Esparza F.Mráz M.Plátek M.Procházka J.Vogel S.Böhm S.Göller T.Brázdil C.Dufourd P.Schnoebelen R.Mayr F.Moller Z.Sawa
Talks about:equival (7) bisimilar (5) decid (5) automata (4) process (4) bisimul (4) undecid (3) grammar (3) counter (3) system (3)
Person: Petr Jancar
DBLP: Jancar:Petr
Contributed to:
2015
2014
2014
201320122010
2008200620032002199919981997199719961995
1995Wrote 17 papers:
- LICS-2015-CzerwinskiJ #branch #process #similarity
- Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME (WC, PJ), pp. 168–179.
- FoSSaCS-2014-Jancar #automaton
- Equivalences of Pushdown Systems Are Hard (PJ), pp. 1–28.
- ICALP-v2-2014-Jancar #bisimulation #equivalence #first-order
- Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.
- STOC-2013-BohmGJ #automaton #equivalence
- Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.
- LICS-2012-Jancar #decidability #equivalence #first-order
- Decidability of DPDA Language Equivalence via First-Order Grammars (PJ), pp. 415–424.
- ICALP-v2-2010-BrazdilJK #game studies #reachability
- Reachability Games on Extended Vector Addition Systems with States (TB, PJ, AK), pp. 478–489.
- DLT-2008-Jancar #decidability #similarity
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (PJ), pp. 56–71.
- FoSSaCS-2006-JancarS #similarity #term rewriting
- Undecidability Results for Bisimilarity on Prefix Rewrite Systems (PJ, JS), pp. 277–291.
- LICS-2003-Jancar #parallel #process #similarity
- Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete (PJ), p. 218–?.
- FoSSaCS-2002-JancarKMS #automaton #bound #proving
- Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.
- ICALP-1999-DufordJS #bound
- Boundedness of Reset P/T Nets (CD, PJ, PS), pp. 301–310.
- ICALP-1998-JancarKM #bisimulation #finite #process
- Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.
- DLT-1997-JancarMPPV #automaton
- Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.
- ICALP-1997-Jancar #bisimulation #decidability #equivalence #process
- Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.
- ICALP-1996-JancarE #bisimulation #petri net
- Deciding Finiteness of Petri Nets Up To Bisimulation (PJ, JE), pp. 478–489.
- DLT-1995-JancarMPPV #automaton #context-free grammar
- Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.
- TAPSOFT-1995-Jancar #petri net #similarity
- High Undecidability of Weak Bisimilarity for Petri Nets (PJ), pp. 349–363.