Petr Jancar

According to our database1, Petr Jancar
  • authored at least 86 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Deciding Structural Liveness of Petri Nets.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016
Deciding structural liveness of Petri nets.
CoRR, 2016

Branching Bisimilarity of Normed BPA Processes as a Rational Monoid.
CoRR, 2016

Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI.
Proceedings of the FM 2016: Formal Methods, 2016

An Approach to Verification of MPI Applications Defined in a High-Level Model.
Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015
On Reachability for Unidirectional Channel Systems Extended with Regular Tests.
Logical Methods in Computer Science, 2015

On Reachability-Related Games on Vector Addition Systems with States.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Bisimulation equivalence and regularity for real-time one-counter automata.
J. Comput. Syst. Sci., 2014

Language equivalence of probabilistic pushdown automata.
Inf. Comput., 2014

Bisimulation Equivalence of First-Order Grammars.
CoRR, 2014

Branching Bisimilarity of Normed BPA Processes is in NEXPTIME.
CoRR, 2014

Bisimulation Equivalence of First-Order Grammars.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Equivalences of Pushdown Systems Are Hard.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Finiteness up to bisimilarity is decidable for pushdown processes
CoRR, 2013

Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes
CoRR, 2013

Equivalence of Deterministic One-Counter Automata is NL-complete
CoRR, 2013

Bisimulation equivalence of first-order grammars is Ackermann-hard.
CoRR, 2013

Equivalence of deterministic one-counter automata is NL-complete.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Bisimilarity of Probabilistic Pushdown Automata
CoRR, 2012

Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Logical Methods in Computer Science, 2012

Decidability of DPDA Language Equivalence via First-Order Grammars.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Unidirectional Channel Systems Can Be Tested.
Proceedings of the Theoretical Computer Science, 2012

Bisimilarity of Probabilistic Pushdown Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010
Complexity of deciding bisimilarity between normed BPA and normed BPP.
Inf. Comput., 2010

Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput., 2010

Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity
CoRR, 2010

Reachability Games on Extended Vector Addition Systems with States
CoRR, 2010

Reachability Games on Extended Vector Addition Systems with States.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Bisimilarity of One-Counter Processes Is PSPACE-Complete.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Hardness of equivalence checking for composed finite-state systems.
Acta Inf., 2009

2008
Undecidability of bisimilarity by defender's forcing.
J. ACM, 2008

Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm.
Inf. Comput., 2008

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
Fundam. Inform., 2008

Selected Ideas Used for Decidability and Undecidability of Bisimilarity.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Normed BPA vs. Normed BPP Revisited.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Monotonicity of Restarting Automata.
Journal of Automata, Languages and Combinatorics, 2007

A note on emptiness for alternating finite automata with a one-letter alphabet.
Inf. Process. Lett., 2007

2006
Equivalence-checking on infinite-state systems: Techniques and results.
TPLP, 2006

Undecidability Results for Bisimilarity on Prefix Rewrite Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005
Equivalence-Checking on Infinite-State Systems: Techniques and Results
CoRR, 2005

Behavioural Equivalences on Finite-State Systems are PTIME-hard.
Computers and Artificial Intelligence, 2005

Determinate STG Decomposition of Marked Graphs.
Proceedings of the Applications and Theory of Petri Nets 2005, 2005

2004
DP lower bounds for equivalence-checking and model-checking of one-counter automata.
Inf. Comput., 2004

Highly Undecidable Questions for Process Algebras.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Deciding Bisimilarity between BPA and BPP Processes.
Proceedings of the CONCUR 2003, 2003

2002
Equivalence-Checking with Infinite-State Systems: Techniques and Results.
Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci., 2001

Nonprimitive recursive complexity and undecidability for Petri net equivalences.
Theor. Comput. Sci., 2001

P-Hardness of Equivalence Testing on Finite-State Processes.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

2000
Decidability of Bisimilarity for One-Counter Processes.
Inf. Comput., 2000

Simulation and Bisimulation over One-Counter Processes.
Proceedings of the STACS 2000, 2000

1999
Petri Nets and Regular Processes.
J. Comput. Syst. Sci., 1999

On Monotonic Automata with a Restart Operation.
Journal of Automata, Languages and Combinatorics, 1999

A Note on Well Quasi-Orderings for Powersets.
Inf. Process. Lett., 1999

Simulation Problems for One-Counter Machines.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Boundedness of Reset P/T Nets.
Proceedings of the Automata, 1999

Techniques for Decidability and Undecidability of Bisimilarity.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Preface.
Electr. Notes Theor. Comput. Sci., 1998

Deciding Bisimulation-Like Equivalences with Finite-State Processes.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Different Types of Monotonicity for Restarting Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
Bisimilarity of processes with finite-state systems.
Electr. Notes Theor. Comput. Sci., 1997

Monotonic Rewriting Automata with a Restart Operation.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Bisimulation Equivalence is Decidable for One-Counter Processes.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Deleting Automata with a Restart Operation.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.
Proceedings of the New Trends in Formal Languages, 1997

1996
Forgetting Automata and Context-Free Languages.
Acta Inf., 1996

Deciding Finiteness of Petri Nets Up To Bisimulation.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Undecidability of Bisimilarity for Petri Nets and Some Related Problems.
Theor. Comput. Sci., 1995

All action-based behavioural equivalences are undecidable for labelled Petri nets.
Bulletin of the EATCS, 1995

High Undecidability of Weak Bisimilarity for Petri Nets.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Restarting Automata.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Restarting Automata, Marcus Grammars and Context-Free Languages.
Proceedings of the Developments in Language Theory II, 1995

Checking Regular Properties of Petri Nets.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems.
Proceedings of the STACS 94, 1994

1993
Completeness Results for Single-Path Petri Nets
Inf. Comput., October, 1993

A Taxonomy of Forgetting Automata.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Characterization of Context-Free Languages by Erasing Automata.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
Single-Path Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
Decidability of a Temporal Logic Problem for Petri Nets.
Theor. Comput. Sci., 1990

1989
Decidability of Waek Fairness in Petri Nets.
Proceedings of the STACS 89, 1989


  Loading...