Using partial orders for the efficient verification of deadlock freedom and safety properties
Open Access
- 1 April 1993
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 2 (2) , 149-164
- https://doi.org/10.1007/bf01383879
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A partial approach to model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Safety for branching time semanticsPublished by Springer Nature ,1991
- On-line model-checking for finite linear temporal logic specificationsLecture Notes in Computer Science, 1990
- On the complexity of omega -automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming, 1984
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Specification and verification of concurrent systems in CESARPublished by Springer Nature ,1982