Jan A. Bergstra
Jan W. Klop
Ernst-Rüdiger Olderog
1987
Failures without Chaos: a Process Semantics for Fair Abstraction
M. Wirsing
Formal Description of Programming Concepts – III
Lecture Notes in Computer Science
North-Holland
Amsterdam
77–101
Flavio Corradini
Maria R. Di Berardini
Walter Vogler
2006
Fairness of Actions in System Computations
Acta Informatica
43
2
73–130
10.1007/s00236-006-0011-2
Gerardo Costa
Colin Stirling
1984
A fair calculus of communicating systems
Acta Informatica
21
5
417–441
10.1007/BF00271640
Edsger W. Dijkstra
1965
Solution of a problem in concurrent programming control
CACM
8
9
569
10.1145/365559.365617
Nissim Francez
1986
Fairness
Springer-Verlag New York, Inc.
New York, NY, USA
10.1007/978-1-4612-4886-6
Rob J. van Glabbeek
1990
The linear time - branching time spectrum
J. C. M. Baeten
J. W. Klop
CONCUR '90 Theories of Concurrency: Unification and Extension: Amsterdam, The Netherlands, August 27–30, 1990 Proceedings
Springer Berlin Heidelberg
Berlin, Heidelberg
278–297
10.1007/BFb0039066
Rob J. van Glabbeek
1993
The linear time — Branching time spectrum II
Eike Best
CONCUR'93: 4th Intrenational Conference on Concurrency Theory Hildesheim, Germany, August 23–26, 1993 Proceedings
Springer Berlin Heidelberg
Berlin, Heidelberg
66–81
10.1007/3-540-57208-2_6
Matthew Hennessy
Robin Milner
1985
Algebraic Laws for Nondeterminism and Concurrency
J. ACM
32
1
137–161
10.1145/2455.2460
Donald E. Knuth
1966
Additional comments on a problem in concurrent programming control
Commun. ACM
9
5
321–322
10.1145/355592.365595
Cees J. Koomen
1985
Algebraic specification and verification of communication protocols
Science of Computer Programming
5
1 – 36
10.1016/0167-6423(85)90002-4
Robin Milner
1980
A Calculus of Communicating Systems
Springer Berlin Heidelberg
Berlin, Heidelberg
10.1007/3-540-10235-3
Faron Moller
Alexander Rabinovich
1999
On the expressive power of CTL
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
360–368
10.1109/LICS.1999.782631
Gordon David Plotkin
1982
A powerdomain for countable non-determinism
418–428
Springer Berlin Heidelberg
Berlin, Heidelberg
10.1007/BFb0012788
Antti Puhakka
2005
Using Fairness Constraints in Process-Algebraic Verification
Dang Van Hung
Martin Wirsing
Theoretical Aspects of Computing – ICTAC 2005: Second International Colloquium, Hanoi, Vietnam, October 17-21, 2005. Proceedings
Springer Berlin Heidelberg
Berlin, Heidelberg
546–561
10.1007/11560647_36
Antti Puhakka
Antti Valmari
2001
Liveness and Fairness in Process-Algebraic Verification
Kim G. Larsen
Mogens Nielsen
CONCUR 2001 — Concurrency Theory: 12th International Conference Aalborg, Denmark, August 20–25, 2001 Proceedings
Springer Berlin Heidelberg
Berlin, Heidelberg
202–217
10.1007/3-540-44685-0_14
Wolfgang Reisig
1998
Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets
Springer Berlin Heidelberg
Berlin, Heidelberg
10.1007/978-3-662-03687-7