Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Three logics for branching bisimulation
Journal of the ACM (JACM)
Introduction to Algorithms
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
SIAM Journal on Computing
Stuttering Abstraction for Model Checkin
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
A New Efficient Simulation Equivalence Algorithm
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Game-theoretic simulation checking tool
Programming and Computing Software
| Hi-index | 0.00 |
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preorder induces a coarser behavioural equivalence that preserves the existential fragment ECTL-{X,G}, namely ECTL without the next-time X and globally G operators. While stuttering bisimulation equivalence can be computed by the well-known Groote and Vaandrager's algorithm, to the best of our knowledge, no algorithm for computing the stuttering simulation preorder and equivalence is available. This paper presents such an algorithm for finite state systems.