Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Simulation preorder over simple process algebras
Information and Computation
MFCS '98 Proceedings of the 23rd 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
Simulation and Bisimulation over One-Counter Processes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
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
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Information Processing Letters
An efficient simulation algorithm based on abstract interpretation
Information and Computation
Information and Computation
An abstract interpretation-based refinement algorithm for strong preservation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Decidability of Weak Simulation on One-Counter Nets
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Why is deciding simulation preorder (and simulation equivalence) computationally harder than deciding bisimulation equivalence on almost all known classes of processes? We try to answer this question by describing two general methods that can be used to construct direct one-to-one polynomial-time reductions from bisimulation equivalence to simulation preorder (and simulation equivalence). These methods can be applied to many classes of finitely generated transition systems, provided that they satisfy certain abstractly formulated conditions. Roughly speaking, our first method works for all classes of systems that can test for 'non-enabledness' of actions, while our second method works for all classes of systems that are closed under synchronization.