@article(DV95, author = {De Nicola, R. and F.W. Vaandrager}, year = {1995}, title = {Three Logics for Branching Bisimulation}, journal = {Journal of the ACM}, volume = {42}, number = {2}, pages = {458--487}, doi = {10.1145/201019.201032}, ) @misc(EWD35, author = {E.W. Dijkstra}, year = {1962 or 1963}, title = {Over de sequentialiteit van processbeschrijvingen}, url = {http://www.cs.utexas.edu/users/EWD/ewd00xx/EWD35.PDF}, ) @article(Dijk65, author = {E.W. Dijkstra}, year = {1965}, title = {Solution of a problem in concurrent programming control}, journal = {Communications of the ACM}, volume = {8}, number = {9}, pages = {569}, doi = {10.1145/365559.365617}, ) @article(EC82, author = {E. Allen Emerson and Edmund M. Clarke}, year = {1982}, title = {Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons.}, journal = {Sci. Comput. Program.}, volume = {2}, number = {3}, pages = {241--266}, doi = {10.1016/0167-6423(83)90017-5}, ) @book(Fr86, author = {N. Francez}, year = {1986}, title = {Fairness}, publisher = {Springer}, address = {New York}, doi = {10.1007/978-1-4612-4886-6}, ) @inproceedings(vG93, author = {R.J. van Glabbeek}, year = {1993}, title = {The Linear Time -- Branching Time Spectrum {II}; The semantics of sequential systems with silent moves}, editor = {E. Best}, booktitle = {{\rm Proceedings} CONCUR'93, {\rm 4$^{\it th}$ International Conference on} Concurrency Theory, {\rm Hildesheim, Germany, August 1993}}, series = {\rm LNCS}, volume = {715}, publisher = {Springer}, pages = {66--81}, doi = {10.1007/3-540-57208-2\_6}, ) @inproceedings(vG18c, author = {R.J. van Glabbeek}, year = {2018}, title = {Is Speed-Independent Mutual Exclusion Implementable?}, editor = {S. Schewe and L. Zhang}, booktitle = {{\rm Proceedings 29th International Conference on} Concurrency Theory {\rm (CONCUR'18), Beijing, China, September 2018}}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, volume = {118}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik}, address = {Dagstuhl, Germany}, doi = {10.4230/LIPIcs.CONCUR.2018.3}, ) @article(vG19c, author = {R.J. van Glabbeek}, year = {2019}, title = {Ensuring liveness properties of distributed systems: Open problems}, journal = {Journal of Logical and Algebraic Methods in Programming}, volume = {109}, eid = {100480}, doi = {10.1016/j.jlamp.2019.100480}, url = {http://arxiv.org/abs/1912.05616}, ) @inproceedings(vG19, author = {R.J. van Glabbeek}, year = {2019}, title = {Justness: A Completeness Criterion for Capturing Liveness Properties (extended abstract)}, editor = {M. Boja\'nczyk and A. Simpson}, booktitle = {{\rm Proceedings 22st International Conference on} Foundations of Software Science and Computation Structures {\rm (FoSSaCS'19); held as part of the} European Joint Conferences on Theory and Practice of Software {\rm (ETAPS'19), Prague, Czech Republic, April 2019}}, series = {\rm LNCS}, volume = {11425}, publisher = {Springer}, pages = {505--522}, doi = {10.1007/978-3-030-17127-8\_29}, ) @article(GGS11, author = {R.J. van Glabbeek and U. Goltz and J.-W. Schicke}, year = {2011}, title = {Abstract Processes of Place/Transition Systems}, journal = {Information Processing Letters}, volume = {111}, number = {13}, pages = {626--633}, doi = {10.1016/j.ipl.2011.03.013}, url = {http://arxiv.org/abs/1103.5916}, ) @article(GH15b, author = {R.J. van Glabbeek and P. H{\"{o}}fner}, year = {2015}, title = {{CCS:} It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions}, journal = {Acta Informatica}, volume = {52}, number = {2-3}, pages = {175--205}, doi = {10.1007/s00236-015-0221-6}, url = {http://arxiv.org/abs/1505.05964}, ) @techreport(GH15a, author = {R.J. van Glabbeek and P. H{\"o}fner}, year = {2015}, title = {Progress, Fairness and Justness in Process Algebra}, type = {Technical Report}, number = {8501}, institution = {NICTA}, address = {Sydney, Australia}, url = {http://arxiv.org/abs/1501.03268}, ) @article(GH19, author = {R.J. van Glabbeek and P. H{\"o}fner}, year = {2019}, title = {Progress, Justness and Fairness}, journal = {ACM Computing Surveys}, volume = {52}, number = {4}, eid = {69}, doi = {10.1145/3329125}, url = {https://arxiv.org/abs/1810.07414}, ) @book(HuthRyan04, author = {M. Huth and M.D. Ryan}, year = {2004}, title = {Logic in Computer Science --- Modelling and Reasoning about Systems}, edition = {2nd}, publisher = {Cambridge University Press}, doi = {10.1017/CBO9780511810275}, ) @article(Kleinrock64, author = {L. Kleinrock}, year = {1964}, title = {Analysis of A Time-Shared Processor}, journal = {Naval Research Logistics Quarterly}, volume = {11}, number = {1}, pages = {59--73}, doi = {10.1002/nav.3800110105}, ) @article(Knuth66, author = {D.E. Knuth}, year = {1966}, title = {Additional comments on a problem in concurrent programming control}, journal = {Communications of the ACM}, volume = {9}, number = {5}, pages = {321--322}, doi = {10.1145/355592.365595}, ) @article(bakery, author = {L. Lamport}, year = {1974}, title = {A New Solution of Dijkstra's Concurrent Programming Problem}, journal = {Communications of the ACM}, volume = {17}, number = {8}, pages = {453--455}, doi = {10.1145/361082.361093}, ) @inproceedings(Lam83, author = {L. Lamport}, year = {1983}, title = {What good is temporal logic?}, editor = {R.E. Mason}, booktitle = {Information Processing 83}, publisher = {North-Holland}, pages = {657--668}, ) @incollection(Mi90ccs, author = {R. Milner}, year = {1990}, title = {Operational and algebraic semantics of concurrent processes}, editor = {J. van Leeuwen}, booktitle = {Handbook of Theoretical Computer Science}, chapter = {19}, publisher = {Elsevier Science Publishers B.V. (North-Holland)}, pages = {1201--1242}, note = {Alternatively see{ \em Communication and Concurrency}, Prentice-Hall, Englewood Cliffs, 1989, of which an earlier version appeared as{ \em A Calculus of Communicating Systems}, LNCS 92, Springer, 1980, doi:\href{http:dx.doi.org/10.1007/3-540-10235-3}{10.1007/3-540-10235-3}}, ) @misc(rfc970, author = {J. Nagle}, year = {1985}, title = {On Packet Switches with Infinite Storage}, howpublished = {RFC 970, Network Working Group}, url = {http://tools.ietf.org/rfc/rfc970.txt}, ) @article(Nagle87, author = {J. Nagle}, year = {1987}, title = {On Packet Switches with Infinite Storage}, journal = {IEEE Trans. Communications}, volume = {35}, number = {4}, pages = {435--438}, doi = {10.1109/TCOM.1987.1096782}, ) @article(Pet81, author = {G.L. Peterson}, year = {1981}, title = {Myths About the Mutual Exclusion Problem}, journal = {Information Processing Letters}, volume = {12}, number = {3}, pages = {115--116}, doi = {10.1016/0020-0190(81)90106-X}, ) @inproceedings(Pnueli77, author = {Amir Pnueli}, year = {1977}, title = {The Temporal Logic of Programs}, booktitle = {Foundations of Computer Science {\rm (FOCS '77)}}, publisher = {IEEE}, pages = {46--57}, doi = {10.1109/SFCS.1977.32}, ) @inproceedings(Szy88, author = {B.K. Szyma\'nski}, year = {1988}, title = {A simple solution to Lamport's concurrent programming problem with linear wait}, editor = {J. Lenfant}, booktitle = {Proceedings of the 2nd international conference on Supercomputing, {ICS} 1988, Saint Malo, France, July 4-8, 1988}, publisher = {{ACM}}, pages = {621--626}, doi = {10.1145/55364.55425}, )