Interleaving set temporal logic
- 1 October 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 75 (3) , 263-287
- https://doi.org/10.1016/0304-3975(90)90096-z
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Decision procedures and expressiveness in the temporal logic of branching timeJournal of Computer and System Sciences, 1985
- Alternative semantics for temporal logicsTheoretical Computer Science, 1983
- The temporal logic of branching timeActa Informatica, 1983
- Decomposition of distributed programs into communication-closed layersScience of Computer Programming, 1982
- An implementation of P and VInformation Processing Letters, 1981
- A formal model of atomicity in asynchronous systemsActa Informatica, 1981
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- Communicating sequential processesCommunications of the ACM, 1978