Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 309-324
- https://doi.org/10.1007/3-540-60045-0_59
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Generation of reduced models for checking fragments of CTLPublished by Springer Nature ,1993
- Symmetry and model checkingPublished by Springer Nature ,1993
- Exploiting symmetry in temporal logic model checkingPublished by Springer Nature ,1993
- Reasoning about systems with many processesJournal of the ACM, 1992
- Minimal state graph generationScience of Computer Programming, 1992
- The Temporal Logic of Reactive and Concurrent SystemsPublished by Springer Nature ,1992
- High-level Petri NetsPublished by Springer Nature ,1991
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- FairnessPublished by Springer Nature ,1986