Science of Computer Programming
Model checking
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ACM Transactions on Computational Logic (TOCL)
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The power of simulation relations
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
An efficient simulation algorithm based on abstract interpretation
Information and Computation
Saving Space in a Time Efficient Simulation Algorithm
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Computing simulations over tree automata: efficient techniques for reducing tree automata
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Logical difference computation with CEX2.5
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
A number of algorithms for computing the simulation preorder on Kripke structures and on labelled transition systems are available. Among them, the algorithm by Ranzato and Tapparo [2007] has the best time complexity,while the algorithm by Gentilini et al. [2003] - successively corrected by van Glabbeek and Ploeger [2008] - has the best space complexity. Both space and time complexities are critical issues in a simulation algorithm, in particular memory requirements are crucial in the context of model checking when dealing with large state spaces. Here, we propose a new simulation algorithm that is obtained as a space saving modification of the time efficient algorithm by Ranzato and Tapparo: a symbolic representation of sets is embedded in this algorithm so that any set of states manipulated by the algorithm can be efficiently stored as a set of blocks of a suitable state partition. It turns out that this novel simulation algorithm has a space complexity comparable with Gentilini et al.'s algorithm while improving on Gentilini et al.'s time bound.