Edit Profile (opens in new tab) Jančar, Petr Compute Distance To: Compute Author ID: jancar.petr Published as: Jančar, Petr; Jancar, Petr; Jančar, P.; Jancǎr, Petr; Jancǎr, P. Documents Indexed: 71 Publications since 1989 2 Contributions as Editor Reviewing Activity: 31 Reviews Co-Authors: 34 Co-Authors with 50 Joint Publications 557 Co-Co-Authors all top 5 Co-Authors 23 single-authored 12 Sawa, Zdeněk 10 Kucera, Antonin 7 Moller, Faron 5 Mráz, František 5 Plátek, Martin 4 Böhm, Stanislav 3 Esparza, Javier 3 Forejt, Vojtěch 3 Göller, Stefan 3 Kiefer, Stefan 3 Kot, Martin 3 Schnoebelen, Philippe 3 Srba, Jiří 3 Vogel, Jörg 3 Worrell, James B. 2 Czerwiński, Wojciech 2 Howell, Rodney R. 2 Karandikar, Prateek 2 Křetínský, Mojmír 2 Leroux, Jérôme 2 Rosier, Louis E. 2 Sutre, Grégoire 1 Brázdil, Tomáš 1 Brim, Luboš 1 Fröschle, Sibylle B. 1 Lasota, Sławomir 1 Mayr, Richard M. 1 Meca, Ondřej 1 Miller, Alexander T. 1 Osicka, Petr 1 Procházka, Martin 1 Purser, David 1 Schäfer, Mark 1 Vogler, Walter all top 5 Serials 7 Information and Computation 5 Theoretical Computer Science 4 Journal of Computer and System Sciences 4 Logical Methods in Computer Science 3 Acta Informatica 2 Information Processing Letters 2 Journal of Automata, Languages and Combinatorics 2 Fundamenta Informaticae 1 Commentationes Mathematicae Universitatis Carolinae 1 Bulletin of the European Association for Theoretical Computer Science (EATCS) 1 Acta Mathematica et Informatica Universitatis Ostraviensis 1 Journal of the ACM 1 Theory and Practice of Logic Programming 1 Computing and Informatics 1 Lecture Notes in Computer Science 1 Electronic Notes in Theoretical Computer Science all top 5 Fields 73 Computer science (68-XX) 5 Mathematical logic and foundations (03-XX) 2 General and overarching topics; collections (00-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Systems theory; control (93-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 52 Publications have been cited 266 times in 178 Documents Cited by ▼ Year ▼ Undecidability of bisimilarity for Petri nets and some related problems. Zbl 0873.68147Jančar, Petr 27 1995 On monotonic automata with a restart operation. Zbl 0942.68064Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg 25 1999 Deciding bisimulation-like equivalences with finite-state processes. Zbl 0974.68131Jančar, P.; Kučera, A.; Mayr, R. 17 2001 Reachability games on extended vector addition systems with states. Zbl 1288.68179Brázdil, Tomáš; Jančar, Petr; Kučera, Antonín 13 2010 Boundedness of reset P/T nets. Zbl 0943.68122Dufourd, C.; Jancǎr, P.; Schnoebelen, Ph. 11 1999 Decidability of a temporal logic problem for Petri nets. Zbl 0701.68081Jančar, Petr 11 1990 Monotonicity of restarting automata. Zbl 1149.68052Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg 10 2007 Petri nets and regular processes. Zbl 0958.68121Jančar, Petr; Esparza, Javier; Moller, Faron 9 1999 A note on well quasi-orderings for powersets. Zbl 0998.06002Jančar, Petr 8 1999 Decidability questions for bisimilarity of Petri nets and some related problems. Zbl 0941.68644Jančar, Petr 7 1994 Simulation problems for one-counter machines. Zbl 0963.68094Jančar, Petr; Moller, Faron; Sawa, Zdeněk 6 1999 Deciding finiteness of Petri nets up to bisimulation. Zbl 1046.68622Jančar, Petr; Esparza, Javier 6 1996 Behavioural equivalences on finite-state systems are PTIME-hard. Zbl 1109.68052Sawa, Zdeněk; Jančar, Petr 6 2005 Equivalence-checking on infinite-state systems: techniques and results. Zbl 1101.68700Kučera, Antonín; Jančar, Petr 6 2006 Undecidability of bisimilarity by defender’s forcing. Zbl 1326.68199Jančar, Petr; Srba, Jiří 6 2008 DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk 5 2004 A taxonomy of forgetting automata. Zbl 0925.68320Jančar, Petr; Mráz, František; Plátek, Martin 5 1993 A note on emptiness for alternating finite automata with a one-letter alphabet. Zbl 1184.68317Jančar, Petr; Sawa, Zdeněk 5 2007 Bisimilarity on basic process algebra is in 2-ExpTime (an explicit proof). Zbl 1260.68269Jančar, Petr 5 2013 Techniques for decidability and undecidability of bisimilarity. Zbl 0940.68087Jančar, Petr; Moller, Faron 5 1999 Equivalences of pushdown systems are hard. Zbl 1407.68258Jančar, Petr 5 2014 Decidability of bisimilarity for one-counter processes. Zbl 1046.68621Jančar, Petr 5 2000 Equivalence of deterministic one-counter automata is NL-complete. Zbl 1293.68181Böhm, Stanislav; Göller, Stefan; Jancar, Petr 5 2013 Bisimulation equivalence is decidable for one-counter processes. Zbl 1401.68229Jančar, Petr 4 1997 Simulation and bisimulation over one-counter processes. Zbl 0962.68121Jančar, Petr; Kučera, Antonín; Moller, Faron 4 2000 Nonprimitive recursive complexity and undecidability for Petri net equivalences. Zbl 0974.68130Jančar, P. 4 2001 Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444Fröschle, Sibylle; Jančar, Petr; Lasota, Slawomir; Sawa, Zdeněk 4 2010 Completeness results for single-path Petri nets. Zbl 0786.68075Howell, Rodney R.; Jančar, Petr; Rosier, Louis E. 3 1993 Restarting automata, Marcus grammars and context-free languages. Zbl 1096.68658Jančar, Petr; Mráz, František; Plátek, Martin; Procházka, Martin; Vogel, Jörg 3 1996 Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk 3 2002 Bisimulation equivalence of first-order grammars. Zbl 1410.68192Jančar, Petr 3 2014 Language equivalence of probabilistic pushdown automata. Zbl 1360.68556Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James 3 2014 Decidability of DPDA language equivalence via first-order grammars. Zbl 1360.68561Jancǎr, Petr 3 2012 P-hardness of equivalence testing on finite-state processes. Zbl 1052.68093Sawa, Zdenek; Jančar, Petr 2 2001 Hardness of equivalence checking for composed finite-state systems. Zbl 1166.68018Sawa, Zdeněk; Jančar, Petr 2 2009 Determinate STG decomposition of marked graphs. Zbl 1128.68385Schäfer, Mark; Vogler, Walter; Jančar, Petr 2 2005 Branching bisimilarity of normed BPA processes is in NExpTime. Zbl 1392.68292Czerwiński, Wojciech; Jančar, Petr 2 2015 Bisimilarity of probabilistic pushdown automata. Zbl 1354.68152Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James 2 2012 Game characterization of probabilistic bisimilarity, and applications to pushdown automata. Zbl 1407.68252Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James 1 2018 Branching bisimilarity of normed BPA processes as a rational monoid. Zbl 1398.68366Jančar, Petr 1 2017 On reachability-related games on vector addition systems with states. Zbl 1471.68166Jančar, Petr 1 2015 Decidability questions for some dynamic properties of Petri nets. (Abstract of thesis). Zbl 0682.68076Jančar, P. 1 1989 Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Zbl 0853.68118Jančar, Petr 1 1993 Deciding bisimilarity between BPA and BPP processes. Zbl 1274.68236Jančar, Petr; Kučera, Antonín; Moller, Faron 1 2003 All action-based behavioural equivalences are undecidable for labelled Petri nets. Zbl 1026.68572Jančar, Petr 1 1995 Unidirectional channel systems can be tested. Zbl 1362.68174Jančar, Petr; Karandikar, Prateek; Schnoebelen, Philippe 1 2012 State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI. Zbl 1427.68184Böhm, Stanislav; Meca, Ondřej; Jančar, Petr 1 2016 Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. Zbl 1435.68169Jančar, Petr 1 2020 Selected ideas used for decidability and undecidability of bisimilarity. Zbl 1161.68621Jančar, Petr 1 2008 Normed BPA vs. normed BPP revisited. Zbl 1160.68468Jančar, Petr; Kot, Martin; Sawa, Zdeněk 1 2008 Equivalence-checking with infinite-state systems: techniques and results. Zbl 1278.68218Kučera, Antonín; Jančar, Petr 1 2002 Bisimilarity of one-counter processes is PSPACE-complete. Zbl 1287.68122Böhm, Stanislav; Göller, Stefan; Jančar, Petr 1 2010 Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. Zbl 1435.68169Jančar, Petr 1 2020 Game characterization of probabilistic bisimilarity, and applications to pushdown automata. Zbl 1407.68252Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James 1 2018 Branching bisimilarity of normed BPA processes as a rational monoid. Zbl 1398.68366Jančar, Petr 1 2017 State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI. Zbl 1427.68184Böhm, Stanislav; Meca, Ondřej; Jančar, Petr 1 2016 Branching bisimilarity of normed BPA processes is in NExpTime. Zbl 1392.68292Czerwiński, Wojciech; Jančar, Petr 2 2015 On reachability-related games on vector addition systems with states. Zbl 1471.68166Jančar, Petr 1 2015 Equivalences of pushdown systems are hard. Zbl 1407.68258Jančar, Petr 5 2014 Bisimulation equivalence of first-order grammars. Zbl 1410.68192Jančar, Petr 3 2014 Language equivalence of probabilistic pushdown automata. Zbl 1360.68556Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James 3 2014 Bisimilarity on basic process algebra is in 2-ExpTime (an explicit proof). Zbl 1260.68269Jančar, Petr 5 2013 Equivalence of deterministic one-counter automata is NL-complete. Zbl 1293.68181Böhm, Stanislav; Göller, Stefan; Jancar, Petr 5 2013 Decidability of DPDA language equivalence via first-order grammars. Zbl 1360.68561Jancǎr, Petr 3 2012 Bisimilarity of probabilistic pushdown automata. Zbl 1354.68152Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James 2 2012 Unidirectional channel systems can be tested. Zbl 1362.68174Jančar, Petr; Karandikar, Prateek; Schnoebelen, Philippe 1 2012 Reachability games on extended vector addition systems with states. Zbl 1288.68179Brázdil, Tomáš; Jančar, Petr; Kučera, Antonín 13 2010 Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444Fröschle, Sibylle; Jančar, Petr; Lasota, Slawomir; Sawa, Zdeněk 4 2010 Bisimilarity of one-counter processes is PSPACE-complete. Zbl 1287.68122Böhm, Stanislav; Göller, Stefan; Jančar, Petr 1 2010 Hardness of equivalence checking for composed finite-state systems. Zbl 1166.68018Sawa, Zdeněk; Jančar, Petr 2 2009 Undecidability of bisimilarity by defender’s forcing. Zbl 1326.68199Jančar, Petr; Srba, Jiří 6 2008 Selected ideas used for decidability and undecidability of bisimilarity. Zbl 1161.68621Jančar, Petr 1 2008 Normed BPA vs. normed BPP revisited. Zbl 1160.68468Jančar, Petr; Kot, Martin; Sawa, Zdeněk 1 2008 Monotonicity of restarting automata. Zbl 1149.68052Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg 10 2007 A note on emptiness for alternating finite automata with a one-letter alphabet. Zbl 1184.68317Jančar, Petr; Sawa, Zdeněk 5 2007 Equivalence-checking on infinite-state systems: techniques and results. Zbl 1101.68700Kučera, Antonín; Jančar, Petr 6 2006 Behavioural equivalences on finite-state systems are PTIME-hard. Zbl 1109.68052Sawa, Zdeněk; Jančar, Petr 6 2005 Determinate STG decomposition of marked graphs. Zbl 1128.68385Schäfer, Mark; Vogler, Walter; Jančar, Petr 2 2005 DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk 5 2004 Deciding bisimilarity between BPA and BPP processes. Zbl 1274.68236Jančar, Petr; Kučera, Antonín; Moller, Faron 1 2003 Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk 3 2002 Equivalence-checking with infinite-state systems: techniques and results. Zbl 1278.68218Kučera, Antonín; Jančar, Petr 1 2002 Deciding bisimulation-like equivalences with finite-state processes. Zbl 0974.68131Jančar, P.; Kučera, A.; Mayr, R. 17 2001 Nonprimitive recursive complexity and undecidability for Petri net equivalences. Zbl 0974.68130Jančar, P. 4 2001 P-hardness of equivalence testing on finite-state processes. Zbl 1052.68093Sawa, Zdenek; Jančar, Petr 2 2001 Decidability of bisimilarity for one-counter processes. Zbl 1046.68621Jančar, Petr 5 2000 Simulation and bisimulation over one-counter processes. Zbl 0962.68121Jančar, Petr; Kučera, Antonín; Moller, Faron 4 2000 On monotonic automata with a restart operation. Zbl 0942.68064Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg 25 1999 Boundedness of reset P/T nets. Zbl 0943.68122Dufourd, C.; Jancǎr, P.; Schnoebelen, Ph. 11 1999 Petri nets and regular processes. Zbl 0958.68121Jančar, Petr; Esparza, Javier; Moller, Faron 9 1999 A note on well quasi-orderings for powersets. Zbl 0998.06002Jančar, Petr 8 1999 Simulation problems for one-counter machines. Zbl 0963.68094Jančar, Petr; Moller, Faron; Sawa, Zdeněk 6 1999 Techniques for decidability and undecidability of bisimilarity. Zbl 0940.68087Jančar, Petr; Moller, Faron 5 1999 Bisimulation equivalence is decidable for one-counter processes. Zbl 1401.68229Jančar, Petr 4 1997 Deciding finiteness of Petri nets up to bisimulation. Zbl 1046.68622Jančar, Petr; Esparza, Javier 6 1996 Restarting automata, Marcus grammars and context-free languages. Zbl 1096.68658Jančar, Petr; Mráz, František; Plátek, Martin; Procházka, Martin; Vogel, Jörg 3 1996 Undecidability of bisimilarity for Petri nets and some related problems. Zbl 0873.68147Jančar, Petr 27 1995 All action-based behavioural equivalences are undecidable for labelled Petri nets. Zbl 1026.68572Jančar, Petr 1 1995 Decidability questions for bisimilarity of Petri nets and some related problems. Zbl 0941.68644Jančar, Petr 7 1994 A taxonomy of forgetting automata. Zbl 0925.68320Jančar, Petr; Mráz, František; Plátek, Martin 5 1993 Completeness results for single-path Petri nets. Zbl 0786.68075Howell, Rodney R.; Jančar, Petr; Rosier, Louis E. 3 1993 Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Zbl 0853.68118Jančar, Petr 1 1993 Decidability of a temporal logic problem for Petri nets. Zbl 0701.68081Jančar, Petr 11 1990 Decidability questions for some dynamic properties of Petri nets. (Abstract of thesis). Zbl 0682.68076Jančar, P. 1 1989 all cited Publications top 5 cited Publications all top 5 Cited by 232 Authors 32 Otto, Friedrich 18 Jančar, Petr 14 Mráz, František 9 Kucera, Antonin 9 Mayr, Richard M. 9 Plátek, Martin 6 Demri, Stéphane P. 6 Schnoebelen, Philippe 6 Srba, Jiří 5 Jurdziński, Tomasz 5 Lasota, Sławomir 5 Moller, Faron 4 Abdulla, Parosh Aziz 4 Göller, Stefan 4 Larsen, Kim Guldstrand 4 Sawa, Zdeněk 4 Schmitz, Sylvain 3 Czerwiński, Wojciech 3 Finkel, Alain 3 Howell, Rodney R. 3 Jonsson, Bengt 3 Kiefer, Stefan 3 Kutrib, Martin 3 Meyer, Roland 3 Nagy, Benedek 3 Niskanen, Reino 3 Potapov, Igor 3 Raskin, Jean-François 3 Strejček, Jan 3 ter Hofstede, Arthur H. M. 3 van der Aalst, Wil M. P. 3 Verbeek, H. M. W. 3 Wang, Qichao 3 Worrell, James B. 3 Wynn, Moe Thandar 2 Beneš, Nikola 2 Chambart, Pierre 2 Chatterjee, Krishnendu 2 Doyen, Laurent 2 Esparza, Javier 2 Forejt, Vojtěch 2 Fröschle, Sibylle B. 2 Gorrieri, Roberto 2 Goubault-Larrecq, Jean 2 Gramatovici, Radu 2 Haase, Christoph 2 Halava, Vesa 2 Halfon, Simon 2 Harju, Tero 2 Hirshfeld, Yoram 2 Hofman, Piotr 2 Huang, Mingzhang 2 Hundeshagen, Norbert 2 Juhl, Line 2 Karandikar, Prateek 2 Křetínský, Jan 2 Křetínský, Mojmír 2 Lazić, Ranko 2 Lugiez, Denis 2 Mordido, Andreia 2 Muskalla, Sebastian 2 Řehák, Vojtěch 2 Rosa-Velardo, Fernando 2 Rosier, Louis E. 2 Saivasan, Prakash 2 Sénizergues, Géraud 2 Vogler, Walter 2 Wendlandt, Matthias 2 Winfree, Erik 1 Akroun, Lakhdar 1 Alechina, Natasha 1 Almeida, Bernardo F. 1 Amadio, Roberto M. 1 Atig, Mohamed Faouzi 1 Baldan, Paolo 1 Bandyopadhyay, Soumyadip 1 Basset, Nicolas 1 Belardinelli, Francesco 1 Belkhir, Walid 1 Ben-Amram, Amir M. 1 Bensch, Suna 1 Bergstra, Jan A. 1 Best, Eike 1 Bethke, Inge 1 Blondin, Michael 1 Böhm, Stanislav 1 Bonchi, Filippo 1 Bordihn, Henning 1 Bouajjani, Ahmed 1 Bozzelli, Laura 1 Bravetti, Mario 1 Brázdil, Tomáš 1 Bulling, Nils 1 Buntrock, Gerhard 1 Cao, Yongzhi 1 Carayol, Arnaud 1 Carbone, Marco 1 Cardona, Riquelmi 1 Čerāns, Karlis 1 Cherkasova, Ludmila A. ...and 132 more Authors all top 5 Cited in 25 Serials 50 Theoretical Computer Science 24 Information and Computation 15 Acta Informatica 9 Journal of Computer and System Sciences 7 Theory of Computing Systems 6 Information Processing Letters 4 Logical Methods in Computer Science 4 RAIRO. Theoretical Informatics and Applications 3 Acta Mathematica et Informatica Universitatis Ostraviensis 3 RAIRO. Theoretical Informatics and Applications 2 Formal Methods in System Design 2 Journal of Automata, Languages and Combinatorics 1 Artificial Intelligence 1 Algebra Universalis 1 Colloquium Mathematicum 1 Information Sciences 1 Journal of Combinatorial Theory. Series B 1 Science of Computer Programming 1 Journal of Symbolic Computation 1 Formal Aspects of Computing 1 Discrete Event Dynamic Systems 1 Archive for Mathematical Logic 1 Soft Computing 1 ACM Transactions on Computational Logic 1 ACM Transactions on Computation Theory all top 5 Cited in 8 Fields 173 Computer science (68-XX) 23 Mathematical logic and foundations (03-XX) 13 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 2 Combinatorics (05-XX) 2 Biology and other natural sciences (92-XX) 1 General topology (54-XX) 1 Systems theory; control (93-XX) Citations by Year