Petri nets: an introduction
Process algebra
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Undecidable equivalences for basic process algebra
Information and Computation
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
Information and Computation - Special issue on EXPRESS 1997
Decidability of bisimilarity for one-counter processes
Information and Computation
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Communication and Concurrency
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Undecidable Equivalences for Basic Parallel Processes
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Deciding Finiteness of Petri Nets Up To Bisimulation
ICALP '96 Proceedings of the 23rd 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
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Regularity is Decidable for Normed PA Processes in Polynomial Time
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Computation: finite and infinite machines
Computation: finite and infinite machines
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
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Information Processing Letters
Verifying compensating transactions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Information and Computation
| Hi-index | 0.00 |
We consider the problem of simulation preorder/equivalence between infinite-state process and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows us to design effective reductions of simulation problems to their bisimulation counterparts and some new decidability border for the problem of simulation preorder/equivalence are decidable in EXPTIME between pushdown and finite-state ones. On the other hand, simulation preorder is undecidable between PA and finite-state process in both directions. These results also hold for those PA and finite-state process which are deterministic and normed, and trace equivalence is also shown to be undecidable for PA. Finally, we prove that simulation preorder (in both directions) and simulation equivalence are interact able between all classes of infinite-state systems (in the hierarchy of process rewrite systems) and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulation a finite-state one is PSPACE- hard and the other direction is co-NP-hard; consequently, simulation equivalence between BPA (or BPP) and finite-state processes is also co-NP-hard.