From Bisimulation to Simulation: Coarsest Partition Problems
Authors:
- 1 September 2003
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 31 (1) , 73-103
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Simulation as Coarsest Partition Problem2002
- A Fast Bisimulation Algorithm2001
- Simulation Revisited2001
- An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps2000
- Simulation Based Minimization2000
- Bisimulation and Model Checking1999
- Generation of reduced models for checking fragments of CTL1993
- Symbolic bisimulation minimisation1993
- A linear-time model-checking algorithm for the alternation-free modal mu-calculus1992
- A Calculus of Communicating Systems1980