Modalities for model checking: branching time logic strikes back
- 30 June 1987
- journal article
- Published by Elsevier BV in Science of Computer Programming
- Vol. 8 (3), 275-306
- https://doi.org/10.1016/0167-6423(87)90036-0
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Linear and branching structures in the semantics and logics of reactive systemsPublished by Springer Science and Business Media LLC ,2005
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Deciding full branching time logicInformation and Control, 1984
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969