Automatic verification of finite-state concurrent systems using temporal logic specifications
- 1 April 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 8 (2) , 244-263
- https://doi.org/10.1145/5397.5399
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Synthesis of Communicating Processes from Temporal Logic SpecificationsACM Transactions on Programming Languages and Systems, 1984
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Verifying Concurrent Processes Using Temporal LogicPublished by Springer Nature ,1982
- Towards Analyzing and Synthesizing ProtocolsIEEE Transactions on Communications, 1980
- Communicating sequential processesCommunications of the ACM, 1978
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969