Process algebra
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
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
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
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
Computation: finite and infinite machines
Computation: finite and infinite machines
Simulation and Bisimulation over One-Counter Processes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th 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
A Logical Viewpoint on Process-Algebraic Quotients
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Information and Computation
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate 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. The decidability border for the mentioned problem is also established. Simulation preorder (in both directions) and simulation equivalence are decidable in EXPTIME between pushdown processes and finite-state ones. On the other hand, simulation preorder is undecidable between PA and finite-state processes in both directions. The obtained results also hold for those PA and finite-state processes which are deterministic and normed, and thus immediately extend to trace preorder. Regularity (finiteness) w.r.t. simulation and trace equivalence is also shown to be undecidable for PA. Finally, we describe a way how to utilize decidability of bisimulation problems to solve certain instances of undecidable simulation problems.We apply this method to BPP processes.