Can message buffers be axiomatized in linear temporal logic?
Open Access
- 1 October 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 63 (1-2) , 88-112
- https://doi.org/10.1016/s0019-9958(84)80043-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Parallel program schemataJournal of Computer and System Sciences, 1969
- A Note on Star-Free EventsJournal of the ACM, 1969