Three Logics for Branching Bisimulation

R. De Nicola F.W. Vaandrager 1995 Three Logics for Branching Bisimulation Journal of the ACM 42 2 458–487 10.1145/201019.201032 E.W. Dijkstra 1962 or 1963 Over de sequentialiteit van processbeschrijvingen http://www.cs.utexas.edu/users/EWD/ewd00xx/EWD35.PDF E.W. Dijkstra 1965 Solution of a problem in concurrent programming control Communications of the ACM 8 9 569 10.1145/365559.365617 E. Allen Emerson Edmund M. Clarke 1982 Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Sci. Comput. Program. 2 3 241–266 10.1016/0167-6423(83)90017-5 N. Francez 1986 Fairness Springer

New York

10.1007/978-1-4612-4886-6 R.J. van Glabbeek 1993 The Linear Time – Branching Time Spectrum II; The semantics of sequential systems with silent moves E. Best Proceedings CONCUR'93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993 LNCS 715 Springer 66–81 10.1007/3-540-57208-2_6 R.J. van Glabbeek 2018 Is Speed-Independent Mutual Exclusion Implementable? S. Schewe L. Zhang Proceedings 29th International Conference on Concurrency Theory (CONCUR'18), Beijing, China, September 2018 Leibniz International Proceedings in Informatics (LIPIcs) 118 Schloss Dagstuhl–Leibniz-Zentrum für Informatik

Dagstuhl, Germany

10.4230/LIPIcs.CONCUR.2018.3 R.J. van Glabbeek 2019 Ensuring liveness properties of distributed systems: Open problems Journal of Logical and Algebraic Methods in Programming 109 100480 10.1016/j.jlamp.2019.100480 http://arxiv.org/abs/1912.05616 R.J. van Glabbeek 2019 Justness: A Completeness Criterion for Capturing Liveness Properties (extended abstract) M. Bojańczyk A. Simpson Proceedings 22st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19); held as part of the European Joint Conferences on Theory and Practice of Software (ETAPS'19), Prague, Czech Republic, April 2019 LNCS 11425 Springer 505–522 10.1007/978-3-030-17127-8_29 R.J. van Glabbeek U. Goltz J.-W. Schicke 2011 Abstract Processes of Place/Transition Systems Information Processing Letters 111 13 626–633 10.1016/j.ipl.2011.03.013 http://arxiv.org/abs/1103.5916 R.J. van Glabbeek P. Höfner 2015 CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions Acta Informatica 52 2-3 175–205 10.1007/s00236-015-0221-6 http://arxiv.org/abs/1505.05964 R.J. van Glabbeek P. Höfner 2015 Progress, Fairness and Justness in Process Algebra Technical Report 8501 NICTA

Sydney, Australia

http://arxiv.org/abs/1501.03268 R.J. van Glabbeek P. Höfner 2019 Progress, Justness and Fairness ACM Computing Surveys 52 4 69 10.1145/3329125 https://arxiv.org/abs/1810.07414 M. Huth M.D. Ryan 2004 Logic in Computer Science — Modelling and Reasoning about Systems 2nd Cambridge University Press 10.1017/CBO9780511810275 L. Kleinrock 1964 Analysis of A Time-Shared Processor Naval Research Logistics Quarterly 11 1 59–73 10.1002/nav.3800110105 D.E. Knuth 1966 Additional comments on a problem in concurrent programming control Communications of the ACM 9 5 321–322 10.1145/355592.365595 L. Lamport 1974 A New Solution of Dijkstra's Concurrent Programming Problem Communications of the ACM 17 8 453–455 10.1145/361082.361093 L. Lamport 1983 What good is temporal logic? R.E. Mason Information Processing 83 North-Holland 657–668 R. Milner 1990 Operational and algebraic semantics of concurrent processes J. van Leeuwen Handbook of Theoretical Computer Science 19 Elsevier Science Publishers B.V. (North-Holland) 1201–1242 Alternatively see Communication and Concurrency, Prentice-Hall, Englewood Cliffs, 1989, of which an earlier version appeared as A Calculus of Communicating Systems, LNCS 92, Springer, 1980, doi:10.1007/3-540-10235-3 J. Nagle 1985 On Packet Switches with Infinite Storage RFC 970, Network Working Group http://tools.ietf.org/rfc/rfc970.txt J. Nagle 1987 On Packet Switches with Infinite Storage IEEE Trans. Communications 35 4 435–438 10.1109/TCOM.1987.1096782 G.L. Peterson 1981 Myths About the Mutual Exclusion Problem Information Processing Letters 12 3 115–116 10.1016/0020-0190(81)90106-X Amir Pnueli 1977 The Temporal Logic of Programs Foundations of Computer Science (FOCS '77) IEEE 46–57 10.1109/SFCS.1977.32 B.K. Szymański 1988 A simple solution to Lamport's concurrent programming problem with linear wait J. Lenfant Proceedings of the 2nd international conference on Supercomputing, ICS 1988, Saint Malo, France, July 4-8, 1988 ACM 621–626 10.1145/55364.55425