Petri nets: an introduction
Process algebra
Handbook of theoretical computer science (vol. B)
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Characteristic formulae for processes with divergence
Information and Computation
Undecidable equivalences for basic process algebra
Information and Computation
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Algorithmic number theory
Decidability of bisimulation equivalence for normed pushdown processes
Theoretical Computer Science
Information and Computation - Special issue on EXPRESS 1997
Decidability of bisimilarity for one-counter processes
Information and Computation
An efficient automata approach to some problems on context-free grammars
Information Processing Letters
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Communication and Concurrency
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Simulation preorder over simple process algebras
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Model-Checking LTL with Regular Valuations for Pushdown Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An Automata Approach to Some Problems on Context-Free Grammars
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
One-counter Markov decision processes
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Minimizing expected termination time in one-counter markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
| Hi-index | 5.23 |
We study the problem of bisimilarity-checking between processes of one-counter automata and finite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets (which are 'restricted' one-counter automata where the counter cannot be tested for zero) and finite-state processes is DP-hard. In particular, this means that the problem is both NP and co-NP hard. The same technique is used to demonstrate co-NP-hardness of strong bisimilarity between processes of one-counter nets. Then we design an algorithm which decides weak bisimilarity between processes of one-counter automata and finite-state processes in time which is polynomial for a large subclass of instances, giving a kind of characterization of all hard instances as a byproduct. Moreover, we show how to efficiently estimate the time which is needed to solve a given instance. Finally, we prove that the problem of strong bisimilarity between processes of one-counter automata and finite-state processes is in P.