CCS: It’s not fair!

It is our great pleasure to dedicate this paper to Walter Vogler on the occasion of his 60th birthday. We have combined two of Walter’s main interests: Petri nets and process algebra. In fact, we proved a result about Petri nets that had been proven before by Walter, but in a restricted form, as we discovered only after finishing our proof. We also transfer this result to the process algebra CCS. Beyond foundational research in the theory of concurrent systems, Walter achieved excellent results in related subjects such as temporal logic and efficiency. In addition to being a dedicated researcher, he is also meticulous in all of his endeavours, including his writing. As a consequence his scientific papers tend to contain no flaws, which is just one of the reasons that makes reading them so enjoyable. It’s fair to say: “CCS Walter!”—Congratulations and Continuous Success!

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

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

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

[4]  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.

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

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

[7]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

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

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

[10]  Jos C. M. Baeten,et al.  Reactive Turing machines , 2013, Inf. Comput..

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

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

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

[14]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[15]  Scott A. Smolka,et al.  Turing machines, transition systems, and interaction , 2004, Inf. Comput..

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

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

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

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

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

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

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

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

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

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

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

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

[28]  Jan A. Bergstra,et al.  Discrete Time Process Algebra , 1992, CONCUR.

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

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

[31]  Daniele Gorla.  Towards a unified approach to encodability and separation results for process calculi , 2010, Inf. Comput..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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