Refining dependencies improves partial-order verification methods (extended abstract)
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 438-449
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
- All from one, one for all: on model checking using representatives1993
- Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits1993
- Defining conditional independence using collapsesTheoretical Computer Science, 1992
- Using partial orders for the efficient verification of deadlock freedom and safety properties1992
- Stubborn sets for reduced state space generation1991
- On-line model-checking for finite linear temporal logic specifications1990
- An improved protocol reachability analysis techniqueSoftware: Practice and Experience, 1988
- Trace theory1987