A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Minimal state graph generation
Science of Computer Programming
Science of Computer Programming
Forward and backward simulations I.: untimed systems
Information and Computation
Semantic preorders in the automated verification of concurrent systems
Semantic preorders in the automated verification of concurrent systems
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Generating diagnostic information for behavioral preorders
Distributed Computing
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Simulation as Coarsest Partition Problem
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
An Abstract Schema for Equivalence-Checking Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
An efficient simulation algorithm based on abstract interpretation
Information and Computation
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Simulation for interactive markov chains
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
An algorithm for probabilistic alternating simulation
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Saving Space in a Time Efficient Simulation Algorithm
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Automatic behavior composition synthesis
Artificial Intelligence
| Hi-index | 0.00 |
This paper develops an efficient algorithm for determining when one system is capable of simulating the behavior of another. The method combines an iterative algorithm for computing behavioral preorders with an algorithm that simultaneously computes the bisimulation equivalence classes of the systems in question. Experimental data indicate that the new routine dramatically outperforms the best-known algoritm for computing simulation, even when the systems are minimized with respect to bisimulation before the simulation algorithm is invoked.