Tutorial: Proving properties of concurrent systems with SPIN
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 453-455
- https://doi.org/10.1007/3-540-60218-6_34
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient on-the-fly model checking for CTLPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple On-the-fly Automatic Verification of Linear Temporal LogicIFIP Advances in Information and Communication Technology, 1996
- An analysis of bitstate hashingIFIP Advances in Information and Communication Technology, 1996
- An Improvement in Formal VerificationPublished by Springer Nature ,1995
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Formal Methods at AT&T - An Industrial Usage ReportPublished by Elsevier ,1992
- An improved protocol reachability analysis techniqueSoftware: Practice and Experience, 1988
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972