Action versus state based logics for transition systems
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 407-419
- https://doi.org/10.1007/3-540-53479-2_17
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient algorithm for branching bisimulation and stuttering equivalencePublished by Springer Nature ,2005
- The concurrency workbenchPublished by Springer Nature ,1990
- Implementing a model checking algorithm by adapting existing automated toolsPublished by Springer Nature ,1990
- Temporal logics for CCSPublished by Springer Nature ,1989
- Branching time temporal logicPublished by Springer Nature ,1989
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- 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
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985