A note on fairness in I/O automata

Information Processing Letters

Volumn 59, Issue 5, 1996, Pages 245-250

  Romijn, Judi ^a   Vaandrager, Frits ^a,b  

^a CWI   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Concurrency; I O automata; Liveness; Strong fairness; Weak fairness

Indexed keywords

EID: 0042540362     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00122-6     Document Type: Article

References (9)

1. M. Abadi and L. Lamport, An old-fashioned recipe for real time, ACM Trans. Programming Languages Systems 16 (5) (1994) 1543-1571.
2. B. Alpern and EB. Schneider, Defining liveness, Inform. Process. Lett. 21 (1985) 181-185.
3. M. Broy and L. Lamport, Specification problem, in: Proc. Dagstuhl-Seminar on the RFC-Memory Specification Problem, Lecture Notes in Computer Science (Springer, Berlin, 1996), to appear.
4. R. Gawlick, R. Segala, J.F. Søgaard-Andersen and N. Lynch, Liveness in timed and untimed systems, in: S. Abiteboul and E. Shamir, eds., Proc. 21th ICALP, Lecture Notes in Computer Science 820 ( Springer, Berlin, 1994 ); a full version is available as MIT Tech. Rept. MIT/LCS/TR-587.
5. B. Jonsson, Compositional specification and verification of distributed systems, ACM Trans. Programming Languages Systems 16 (2) (19940 259-303.
6. L. Lamport, The temporal logic of actions, ACM Trans. Programming Languages Systems 16 (3) (1994) 872-923.
7. N.A. Lynch and M.R. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. 6th Ann. ACM Symp. on Principles of Distributed Computing (1987) 137-151; A full version is available as MIT Tech. Rept. MIT/LCS/TR-387.
8. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification (Springer, Berlin, 1992).
9. J.M.T. Romijn, Tackling the RFC-Memory specification problem with I/O automata, in: Proc. Dagstuhl-Seminar on the RFC-Memory Specification Problem, Lecture Notes in Computer Science (Springer, Berlin, 1996), to appear.