Can message buffers be axiomatized in linear temporal logic?

DOI10.1016/S0019-9958(84)80043-1zbMath0591.68022MaRDI QIDQ3719805

Nissim Francez, Albert R. Meyer, A. P. Sistla, Edmund M. Clarke

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

distributed systeminterprocess communicationMessage passingpropositional temporal logicFIFO buffersLIFO buffersunordered buffers

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Safety, liveness and fairness in temporal logic, Ordered multi-stack visibly pushdown automata, The tail-recursive fragment of timed recursive CTL, A Branching Time Logical System for Open Distributed Systems Development, Expressibility of output equals input. Negative and positive results