Operational and Algebraic Semantics of Concurrent Processes

Publisher Summary This chapter presents a particular class of mathematical models for concurrent communicating processes, namely, the class of algebraic calculi. The chapter describes a small language whose constructions reflect simple operational ideas; the meaning of these constructions is presented by means of structured operational semantics. Congruence relation is interpreted as equality of processes. The essence of the congruence is that it is built upon the idea of observing a process, which is taken to mean communicating with it. The idea is that the processes are equal if they are indistinguishable in any experiment based upon observation. Observation equivalence is characterized by a simple modal logic.

[1]  Colin Stirling,et al.  A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language , 1988, Theor. Comput. Sci..

[2]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..

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

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

[5]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

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

[7]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

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

[9]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[10]  Cliff B. Jones,et al.  Specification and Design of (Parallel) Programs , 1983, IFIP Congress.

[11]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

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

[13]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

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

[15]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[16]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[17]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

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

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

[20]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems , 1992, EATCS Monographs in Theoretical Computer Science.

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

[22]  D. J. Walker,et al.  Bisimulation and Divergence , 1990, Inf. Comput..