CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes

[1]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[2]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[3]  Rocco De Nicola,et al.  Possible Worlds for Process Algebras , 1998, CONCUR.

[4]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[5]  Antti Valmari.  Failure-based Equivalences Are Faster Than Many Believe , 1995, STRICT.

[6]  Jan Friso Groote,et al.  Undecidable Equivalences for Basic Process Algebra , 1994, Inf. Comput..

[7]  M. Hollenberg.  Hennessy-Milner Classes and Process Algebra , 1994 .

[8]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[9]  Steven J. Vickers,et al.  Quantales, observational logic and process semantics , 1993, Mathematical Structures in Computer Science.

[10]  A. W. Roscoe.  Unbounded Non-Determinism in CSP , 1993, J. Log. Comput..

[11]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[12]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[13]  Philippe Schnoebelen,et al.  Experiments on Processes with Backtracking , 1991, CONCUR.

[14]  Rob J. van Glabbeek.  The Refinement Theorem for ST-bisimulation Semantics , 1990, Programming Concepts and Methods.

[15]  Jan A. Bergstra,et al.  Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..

[16]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

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

[18]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[19]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

[20]  Ernst-Rüdiger Olderog,et al.  Contrasting Themes in the Semantics of Imperative Concurrency , 1986, Current Trends in Concurrency.

[21]  Jan Willem Klop,et al.  Failure semantics with fair abstraction , 1986 .

[22]  Matthew Hennessy,et al.  Acceptance trees , 1985, JACM.

[23]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[24]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[25]  Joost Engelfriet,et al.  Determinacy - (Observation Equivalence = Trace Equivalence) , 1985, Theor. Comput. Sci..

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

[27]  A. W. Roscoe,et al.  An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

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

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

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

[31]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

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

[33]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[34]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[35]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[37]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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