Linear and Branching Structures in the Semantics and Logics of Reactive Systems

In this presentation we reviewed the dichotomy between branching and linear views of reactive systems as they are reflected in three different approaches to the formalization of reactive systems. Hopefully we succeeded in convincing the reader that these views are distinct and represent different attitudes to the desired level of abstractness in the semantics of reactive systems. The branching view is always more detailed than the linear view, and the important question that should be left open for the user of the approach, is whether this additional detail is necessary for his application.

[1]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[2]  Arnold Schönhage.  An Elementary Proof for Strassen's Degree Bound , 1976, Theor. Comput. Sci..

[3]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[4]  C. A. R. Hoare,et al.  Semantics of Nondeterminism, Concurrency, and Communication , 1979, J. Comput. Syst. Sci..

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

[6]  Matthew Hennessy,et al.  A Term Model for CCS , 1980, MFCS.

[7]  Willem P. de Roever,et al.  A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

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

[9]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[10]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[11]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[12]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[13]  Stephen D. Brookes,et al.  Possible futures, acceptances, refusals, and communicating processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[15]  Rocco De Nicola,et al.  A Complete Set of Axioms for a Theory of Communicating Sequential Processes , 1983, FCT.

[16]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[17]  Rocco De Nicola,et al.  Testing Equivalence for Processes , 1983, ICALP.

[18]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[19]  Stephen D. Brookes,et al.  On the Relationship of CCS and CSP , 1983, ICALP.

[20]  Stephen D. Brookes,et al.  A Semantics and Proof System for Communicating Processes , 1983, Logic of Programs.

[21]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

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

[23]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[24]  S. Graf,et al.  A Logic for the Specification and Proof of Controllable Processes of CCS , 1989, Logics and Models of Concurrent Systems.

[25]  Jan A. Bergstra,et al.  Linear Time and Branching Time Semantics for Recursion with Merge , 1983, Theor. Comput. Sci..

[26]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[27]  Amir Pnueli,et al.  A Linear-History Semantics for Languages for Distributed Programming , 1984, Theor. Comput. Sci..

[28]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[29]  Joseph Sifakis,et al.  A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1986, Inf. Control..

[30]  Joseph Sifakis,et al.  A Logic for the Description of Non-deterministic Programs and Their Properties , 1986, Inf. Control..