Model Checking Partial State Spaces with 3-Valued Temporal Logics
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 274-287
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Why is modal logic so robustly decidable?1997
- The Temporal Logic of Reactive and Concurrent Systems1992
- Bisimulation and divergenceInformation and Computation, 1990
- Some modal logics based on a three-valued logic.Notre Dame Journal of Formal Logic, 1988
- Modal logics for communicating systemsTheoretical Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Correspondence Theory1984
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Some Modal Logics based on a Three‐valued LogicTheoria, 1967