CCS: It’s not fair!

[1]  Rob J. van Glabbeek,et al.  Progress, Fairness and Justness in Process Algebra , 2015, ArXiv.

[2]  Annabelle McIver,et al.  A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV , 2013, ArXiv.

[3]  Rob J. van Glabbeek,et al.  Musings on Encodings and Expressiveness , 2012, EXPRESS/SOS.

[4]  Jos C. M. Baeten,et al.  Reactive Turing machines , 2011, Inf. Comput..

[5]  Ursula Goltz,et al.  Abstract processes of place/transition systems , 2011, Inf. Process. Lett..

[6]  Walter Vogler,et al.  Liveness of a mutex algorithm in a fair process algebra , 2009, Acta Informatica.

[7]  Walter Vogler,et al.  Time and Fairness in a Process Algebra with Non-blocking Reading , 2009, SOFSEM.

[8]  Daniele Gorla,et al.  Towards a unified approach to encodability and separation results for process calculi , 2008, Inf. Comput..

[9]  Joachim Parrow,et al.  Expressiveness of Process Algebras , 2008, LIX.

[10]  Rob J. van Glabbeek,et al.  On Specifying Timeouts , 2006, APC 25.

[11]  Walter Vogler,et al.  Fairness of Actions in System Computations , 2006, Acta Informatica.

[12]  Ernst-Rüdiger Olderog,et al.  Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationship , 2005 .

[13]  Walter Vogler,et al.  Comparing the worst-case efficiency of asynchronous systems with PAFAS , 2002, Acta Informatica.

[14]  Walter Vogler,et al.  Efficiency of asynchronous systems, read arcs, and the MUTEX-problem , 2002, Theor. Comput. Sci..

[15]  Scott A. Smolka,et al.  Turing Machines, Transition Systems, and Interaction , 2002, EXPRESS.

[16]  Jan van Leeuwen,et al.  Beyond the Turing Limit: Evolving Interactive Systems , 2001, SOFSEM.

[17]  Antti Valmari,et al.  Liveness and Fairness in Process-Algebraic Verification , 2001, CONCUR.

[18]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[19]  Ekkart Kindler,et al.  Mutex Needs Fairness , 1997, Inf. Process. Lett..

[20]  Antti Valmari,et al.  Visual Verification of Safety and Liveness , 1996, FME.

[21]  Javier Esparza,et al.  Trapping Mutual Exclusion in the Box Calculus , 1996, Theor. Comput. Sci..

[22]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[23]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[24]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[25]  Jan A. Bergstra,et al.  Discrete time process algebra , 1992, Formal Aspects of Computing.

[26]  Frits W. Vaandrager,et al.  Expressive Results for Process Algebras , 1992, REX Workshop.

[27]  K. V. S. Prasad.  A Calculus of Broadcasting Systems , 1991, Sci. Comput. Program..

[28]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[29]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[30]  D. J. Walker,et al.  Automated analysis of mutual exclusion algorithms using CCS , 1989, Formal Aspects of Computing.

[31]  Nissim Francez,et al.  Appraising fairness in languages for distributed programming , 1988, Distributed Computing.

[32]  Jan A. Bergstra,et al.  Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator , 1987, Comput. J..

[33]  John B. Nagle,et al.  On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..

[34]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[35]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[36]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[37]  Rocco De Nicola,et al.  CCS is an (Augmented) Contact Free C/E System , 1986, Mathematical Models for the Semantics of Parallelism.

[38]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[39]  Jan A. Bergstra,et al.  Verification of an alternating bit protocol by means of process algebra , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[40]  Wolfgang Reisig.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[41]  Gerardo Costa,et al.  Weak and Strong Fairness in CCS , 1984, Inf. Comput..

[42]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[43]  Gerardo Costa,et al.  A fair calculus of communicating systems , 1983, Acta Informatica.

[44]  Gordon D. Plotkin,et al.  A Powerdomain for Countable Non-Determinism (Extended Abstract) , 1982, ICALP.

[45]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[46]  Gary L. Peterson,et al.  Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..

[47]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[48]  Peter E. Lauer,et al.  COSY — a system specification language based on paths and processes , 1979, Acta Informatica.

[49]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[50]  Leonard Kleinrock,et al.  Analysis of A time‐shared processor , 1964 .

[51]  Luca Aceto,et al.  Reactive Systems: Modelling mutual exclusion algorithms , 2007 .

[52]  Edsger W. Dijkstra,et al.  Cooperating sequential processes , 2002 .

[53]  Walter Vogler,et al.  A Faster-than Relation for Asynchronous Processes , 2001, CONCUR.

[54]  Rance Cleaveland,et al.  Priority in Process Algebra , 2001, Handbook of Process Algebra.

[55]  Jan A. Bergstra,et al.  Algebra of Communicating Processes , 1995, Workshops in Computing.

[56]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .

[57]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[58]  Amar Bouali,et al.  Weak and branching bisimulation in Fctool , 1992 .

[59]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[60]  Jan Friso Groote,et al.  The syntax and semantics of $ mu $ CRL , 1990 .

[61]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[62]  D. Walker,et al.  A Calculus of Mobile Processes, Part Ii , 1989 .

[63]  Lutz Priese,et al.  Fairness , 1988, Bull. EATCS.

[64]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[65]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.