Partial-order methods for temporal verification
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 233-246
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Using partial orders for the efficient verification of deadlock freedom and safety propertiesFormal Methods in System Design, 1993
- State space caching revisited1993
- Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits1993
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Defining conditional independence using collapsesTheoretical Computer Science, 1992
- Stubborn sets for reduced state space generation1991
- On the relation of programs and computations to models of temporal logic1989
- Recognizing safety and livenessDistributed Computing, 1987
- Trace theory1987