Petr Jancar

119 papers A* 9A 3B 26C 3Journal 61Unranked 16
YearRankTypeTitle / Venue / Authors
2026 J jnl
Diagnosability verification for automata and Petri nets: Can we do better?
Autom.
Shaowen Miao, Petr Jancar, Jan Komenda, Tomás Masopust, Aiwen Lai
2026 J jnl
Well-Formed Free-Choice Petri Nets Revisited.
CoRR
Petr Jancar, Eike Best, Raymond Devillers, Matej Ostadal
2025 B conf
Coverability in Well-Formed Free-Choice Nets.
Petri Nets
Eike Best, Raymond Devillers, Petr Jancar
2025 B conf
Structural Liveness of Conservative Petri Nets.
FoSSaCS
Petr Jancar, Jérôme Leroux, Jiri Valusek
2025 J jnl
Structural Liveness of Conservative Petri Nets.
CoRR
Petr Jancar, Jérôme Leroux, Jiri Valusek
2024 J jnl
A concise proof of Commoner's theorem.
CoRR
Petr Jancar
2024 J jnl
On the Home-Space Problem for Petri Nets and its Ackermannian Complexity.
Log. Methods Comput. Sci.
Petr Jancar, Jérôme Leroux
2024 — conf
On the Home-Space Problem for Petri Nets.
Taming the Infinities of Concurrency
Petr Jancar, Jérôme Leroux
2023 J jnl
Countdown games, and simulation on (succinct) one-counter nets.
Log. Methods Comput. Sci.
Petr Jancar, Petr Osicka, Zdenek Sawa
2023 B conf
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets.
CONCUR
Petr Jancar, Jérôme Leroux
2022 J jnl
Bisimilarity on Basic Parallel Processes.
Theor. Comput. Sci.
Petr Jancar
2022 J jnl
Resource Bisimilarity in Petri Nets is Decidable.
Fundam. Informaticae
Irina A. Lomazova, Vladimir A. Bashkin, Petr Jancar
2022 J jnl
Semilinear Home-space is Decidable for Petri Nets.
CoRR
Petr Jancar, Jérôme Leroux
2022 J jnl
Structural Liveness of Immediate Observation Petri Nets.
Fundam. Informaticae
Petr Jancar, Jiri Valusek
2021 J jnl
Equivalence of pushdown automata via first-order grammars.
J. Comput. Syst. Sci.
Petr Jancar
2021 J jnl
Simplest Non-Regular Deterministic Context-Free Language.
CoRR
Petr Jancar, Jirí Síma
2021 J jnl
Structural Liveness of Immediate Observation Petri Nets.
CoRR
Jiri Valusek, Petr Jancar
2021 B conf
The Simplest Non-Regular Deterministic Context-Free Language.
MFCS
Petr Jancar, Jirí Síma
2020 J jnl
Countdown games, and simulation on (succinct) one-counter nets.
CoRR
Petr Jancar, Petr Osicka, Zdenek Sawa
2020 J jnl
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence.
J. Comput. Syst. Sci.
Petr Jancar
2019 A* conf
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.
LICS
Petr Jancar, Sylvain Schmitz
2019 J jnl
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.
CoRR
Petr Jancar, Sylvain Schmitz
2019 J jnl
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States.
Fundam. Informaticae
Petr Jancar, Jérôme Leroux, Grégoire Sutre
2019 J jnl
Structural liveness of Petri nets is ExpSpace-hard and decidable.
Acta Informatica
Petr Jancar, David Purser
2018 B conf
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States.
Petri Nets
Petr Jancar, Jérôme Leroux, Grégoire Sutre
2018 — conf
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets.
RP
Petr Jancar, Petr Osicka, Zdenek Sawa
2018 J jnl
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets.
CoRR
Petr Jancar, Petr Osicka, Zdenek Sawa
2018 J jnl
Equivalence of pushdown automata via first-order grammars.
CoRR
Petr Jancar
2018 J jnl
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata.
Log. Methods Comput. Sci.
Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2017 J jnl
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid.
Log. Methods Comput. Sci.
Petr Jancar
2017 B conf
Deciding Structural Liveness of Petri Nets.
SOFSEM
Petr Jancar
2017 J jnl
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata.
CoRR
Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2016 — conf
An Approach to Verification of MPI Applications Defined in a High-Level Model.
ACSD
Ondrej Meca, Stanislav Böhm, Marek Behalek, Petr Jancar
2016 J jnl
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid.
CoRR
Petr Jancar
2016 B conf
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
MFCS
Petr Jancar
2016 J jnl
Deciding structural liveness of Petri nets.
CoRR
Petr Jancar
2016 B conf
State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI.
FM
Stanislav Böhm, Ondrej Meca, Petr Jancar
2015 A* conf
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME.
LICS
Wojciech Czerwinski, Petr Jancar
2015 J jnl
On Reachability for Unidirectional Channel Systems Extended with Regular Tests.
Log. Methods Comput. Sci.
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
2015 — conf
On Reachability-Related Games on Vector Addition Systems with States.
RP
Petr Jancar
2014 — conf
Bisimulation Equivalence of First-Order Grammars.
ICALP (2)
Petr Jancar
2014 J jnl
Bisimulation Equivalence of First-Order Grammars.
CoRR
Petr Jancar
2014 J jnl
Bisimulation equivalence and regularity for real-time one-counter automata.
J. Comput. Syst. Sci.
Stanislav Böhm, Stefan Göller, Petr Jancar
2014 J jnl
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME.
CoRR
Wojciech Czerwinski, Petr Jancar
2014 B conf
Equivalences of Pushdown Systems Are Hard.
FoSSaCS
Petr Jancar
2014 J jnl
Language equivalence of probabilistic pushdown automata.
Inf. Comput.
Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2013 J jnl
Bisimulation equivalence of first-order grammars is Ackermann-hard.
CoRR
Petr Jancar
2013 B conf
Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
MFCS
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa
2013 J jnl
Equivalence of Deterministic One-Counter Automata is NL-complete
CoRR
Stanislav Böhm, Stefan Göller, Petr Jancar
2013 A* conf
Equivalence of deterministic one-counter automata is NL-complete.
STOC
Stanislav Böhm, Stefan Göller, Petr Jancar
2013 J jnl
Finiteness up to bisimilarity is decidable for pushdown processes
CoRR
Petr Jancar
2013 J jnl
Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes
CoRR
Petr Jancar, Jirí Srba
2012 J jnl
Bisimilarity of Probabilistic Pushdown Automata
CoRR
Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2012 — conf
Bisimilarity of Probabilistic Pushdown Automata.
FSTTCS
Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2012 J jnl
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Log. Methods Comput. Sci.
Petr Jancar
2012 A* conf
Decidability of DPDA Language Equivalence via First-Order Grammars.
LICS
Petr Jancar
2012 — conf
Unidirectional Channel Systems Can Be Tested.
IFIP TCS
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
2010 B conf
Bisimilarity of One-Counter Processes Is PSPACE-Complete.
CONCUR
Stanislav Böhm, Stefan Göller, Petr Jancar
2010 J jnl
Complexity of deciding bisimilarity between normed BPA and normed BPP.
Inf. Comput.
Petr Jancar, Martin Kot, Zdenek Sawa
2010 J jnl
Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput.
Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa
2010 J jnl
Reachability Games on Extended Vector Addition Systems with States
CoRR
Tomás Brázdil, Petr Jancar, Antonín Kucera
2010 — conf
Reachability Games on Extended Vector Addition Systems with States.
ICALP (2)
Tomás Brázdil, Petr Jancar, Antonín Kucera
2010 J jnl
Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity
CoRR
Petr Jancar
2009 J jnl
Hardness of equivalence checking for composed finite-state systems.
Acta Informatica
Zdenek Sawa, Petr Jancar
2008 J jnl
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm.
Inf. Comput.
Petr Jancar
2008 B conf
Normed BPA vs. Normed BPP Revisited.
CONCUR
Petr Jancar, Martin Kot, Zdenek Sawa
2008 J jnl
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
Fundam. Informaticae
Javier Esparza, Petr Jancar, Alexander Miller
2008 C conf
Selected Ideas Used for Decidability and Undecidability of Bisimilarity.
Developments in Language Theory
Petr Jancar
2008 J jnl
Undecidability of bisimilarity by defender's forcing.
J. ACM
Petr Jancar, Jirí Srba
2007 J jnl
A note on emptiness for alternating finite automata with a one-letter alphabet.
Inf. Process. Lett.
Petr Jancar, Zdenek Sawa
2007 J jnl
Monotonicity of Restarting Automata.
J. Autom. Lang. Comb.
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
2006 J jnl
Equivalence-checking on infinite-state systems: Techniques and results.
Theory Pract. Log. Program.
Antonín Kucera, Petr Jancar
2006 — conf
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
ACSD
Javier Esparza, Petr Jancar, Alexander Miller
2006 B conf
Undecidability Results for Bisimilarity on Prefix Rewrite Systems.
FoSSaCS
Petr Jancar, Jirí Srba
2005 J jnl
Behavioural Equivalences on Finite-State Systems are PTIME-hard.
Comput. Artif. Intell.
Zdenek Sawa, Petr Jancar
2005 — conf
Determinate STG Decomposition of Marked Graphs.
ICATPN
Mark Schäfer, Walter Vogler, Petr Jancar
2005 J jnl
Equivalence-Checking on Infinite-State Systems: Techniques and Results
CoRR
Antonín Kucera, Petr Jancar
2004 J jnl
DP lower bounds for equivalence-checking and model-checking of one-counter automata.
Inf. Comput.
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
2004 — conf
Highly Undecidable Questions for Process Algebras.
IFIP TCS
Petr Jancar, Jirí Srba
2003 B conf
Deciding Bisimilarity between BPA and BPP Processes.
CONCUR
Petr Jancar, Antonín Kucera, Faron Moller
2003 A* conf
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete.
LICS
Petr Jancar
2002 B ed.
CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings
CONCUR
Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera
2002 B conf
Equivalence-Checking with Infinite-State Systems: Techniques and Results.
SOFSEM
Antonín Kucera, Petr Jancar
2002 B conf
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
FoSSaCS
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
2001 J jnl
Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci.
Petr Jancar, Antonín Kucera, Richard Mayr
2001 J jnl
Nonprimitive recursive complexity and undecidability for Petri net equivalences.
Theor. Comput. Sci.
Petr Jancar
2001 B conf
P-Hardness of Equivalence Testing on Finite-State Processes.
SOFSEM
Zdenek Sawa, Petr Jancar
2000 J jnl
Decidability of Bisimilarity for One-Counter Processes.
Inf. Comput.
Petr Jancar
2000 A conf
Simulation and Bisimulation over One-Counter Processes.
STACS
Petr Jancar, Antonín Kucera, Faron Moller
1999 J jnl
A Note on Well Quasi-Orderings for Powersets.
Inf. Process. Lett.
Petr Jancar
1999 A* conf
Boundedness of Reset P/T Nets.
ICALP
Catherine Dufourd, Petr Jancar, Philippe Schnoebelen
1999 J jnl
On Monotonic Automata with a Restart Operation.
J. Autom. Lang. Comb.
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1999 J jnl
Petri Nets and Regular Processes.
J. Comput. Syst. Sci.
Petr Jancar, Javier Esparza, Faron Moller
1999 B conf
Simulation Problems for One-Counter Machines.
SOFSEM
Petr Jancar, Faron Moller, Zdenek Sawa
1999 B conf
Techniques for Decidability and Undecidability of Bisimilarity.
CONCUR
Petr Jancar, Faron Moller
1998 A* conf
Deciding Bisimulation-Like Equivalences with Finite-State Processes.
ICALP
Petr Jancar, Antonín Kucera, Richard Mayr
1998 — conf
Different Types of Monotonicity for Restarting Automata.
FSTTCS
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1998 — conf
Preface.
MFCS Workshop on Concurrency
Petr Jancar, Mojmír Kretínský
1998 — ed.
Proceedings of the MFCS '98 Workshop on Concurrency, Brno, Czech Republic, August 27-29, 1998
MFCS Workshop on Concurrency
Petr Jancar, Mojmír Kretínský
1997 — conf
Bisimilarity of processes with finite-state systems.
INFINITY
Petr Jancar, Antonín Kucera
1997 A* conf
Bisimulation Equivalence is Decidable for One-Counter Processes.
ICALP
Petr Jancar
1997 C conf
Deleting Automata with a Restart Operation.
Developments in Language Theory
Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
1997 B conf
Monotonic Rewriting Automata with a Restart Operation.
SOFSEM
Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel
1997 — conf
On Restarting Automata with Rewriting.
New Trends in Formal Languages
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1996 A* conf
Deciding Finiteness of Petri Nets Up To Bisimulation.
ICALP
Petr Jancar, Javier Esparza
1996 J jnl
Forgetting Automata and Context-Free Languages.
Acta Informatica
Petr Jancar, Frantisek Mráz, Martin Plátek
1995 J jnl
All action-based behavioural equivalences are undecidable for labelled Petri nets.
Bull. EATCS
Petr Jancar
1995 B conf
Checking Regular Properties of Petri Nets.
CONCUR
Petr Jancar, Faron Moller
1995 — conf
High Undecidability of Weak Bisimilarity for Petri Nets.
TAPSOFT
Petr Jancar
1995 C conf
Restarting Automata, Marcus Grammars and Context-Free Languages.
Developments in Language Theory
Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
1995 B conf
Restarting Automata.
FCT
Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
1995 J jnl
Undecidability of Bisimilarity for Petri Nets and Some Related Problems.
Theor. Comput. Sci.
Petr Jancar
1994 A conf
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems.
STACS
Petr Jancar
1993 B conf
A Taxonomy of Forgetting Automata.
MFCS
Petr Jancar, Frantisek Mráz, Martin Plátek
1993 J jnl
Completeness Results for Single-Path Petri Nets
Inf. Comput.
Rodney R. Howell, Petr Jancar, Louis E. Rosier
1992 B conf
Characterization of Context-Free Languages by Erasing Automata.
MFCS
Petr Jancar, Frantisek Mráz, Martin Plátek
1991 B conf
Single-Path Petri Nets.
MFCS
Rodney R. Howell, Petr Jancar, Louis E. Rosier
1990 J jnl
Decidability of a Temporal Logic Problem for Petri Nets.
Theor. Comput. Sci.
Petr Jancar
1989 A conf
Decidability of Waek Fairness in Petri Nets.
STACS
Petr Jancar