Three partition refinement algorithms
SIAM Journal on Computing
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Science of Computer Programming
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
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
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Simulation for interactive markov chains
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Hi-index | 0.00 |
The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure. Such an equivalence has suggested efficient algorithms for the computation of the maximal bisimulation relation.In this paper the simulation problem is rewritten in terms of coarsest stable partition problem allowing a more algebraic understanding of the simulation equivalence. On this ground, a new algorithm for deciding simulation is proposed. Such a procedure improves on either space or time complexity of previous simulation algorithms.