On the Operational Semantics of Nondeterminism and Divergence

Abstract An operational model of nondeterministic processes coupled with a novel theory of divergence is presented. The operational model represents internal nondeterminism without using explicit internal transitions. Here the notion of internal state effectively replaces the familiar notion of internal transition, giving rise to an alternative operational view of processes: the weak process. Roughly, a weak process is a collection of stable internal states together with a set of transitions each of which is defined from an internal state to another weak process. Internal nondeterminism arises from such refinement of processes into multiple internal states. A simple extension to the basic weak process model gives rise to an elaborate operational theory of divergence. According to this theory, the ability of a process to undertake an infinite internal computation which is pathological, or persistent, is distinguished from its ability to undertake an infinite internal computation which is not. Although applicable to process algebraic languages with an internal action construct, the resulting model is most suitable for supplying operational semantics to process algebras which express internal nondeterminism by an internal choice construct. The distinction between the two forms of divergence is in particular taken into account when the hiding construct of such a process algebra is assigned a weak process semantics.

[1]  Colin Stirling,et al.  Verifying Temporal Properties of Processes , 1990, CONCUR.

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

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

[4]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[5]  R. L. Goodstein,et al.  The theory of sets and transfinite numbers , 1967, The Mathematical Gazette.

[6]  Robert E. Milne,et al.  The formal description technique LOTOS : By P.H.J. van Eijk, C.A. Vissers and M. Diaz, eds. North-Holland, Amsterdam, Netherlands, 1989, Price $102.50 (hardback), ISBN 0-444-87267-1. , 1990 .

[7]  C. A. R. Hoare,et al.  Specification-Oriented Semantics for Communicating Processes , 1983, ICALP.

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

[9]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[10]  Martin M. Zuckerman Sets and transfinite numbers , 1974 .

[11]  Hakan Erdogmus,et al.  On the Specification and Synthesis of Communicating Processes , 1990, IEEE Trans. Software Eng..

[12]  Gregor von Bochmann,et al.  The Equivalence in the DCP Model , 1991, Theor. Comput. Sci..

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

[14]  Flemming Nielson,et al.  Semantics with applications - a formal introduction , 1992, Wiley professional computing.

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

[16]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[17]  J.C.M. Baeten,et al.  CONCUR '90 Theories of Concurrency: Unification and Extension , 1990, Lecture Notes in Computer Science.

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

[19]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

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

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

[22]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

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

[24]  Glynn Winskel,et al.  Seminar on Concurrency , 1984, Lecture Notes in Computer Science.

[25]  Rocco De Nicola,et al.  CCS without tau's , 1987, TAPSOFT, Vol.1.

[26]  K. Larsen Context-dependent bisimulation between processes , 1986 .

[27]  R. J. vanGlabbeek The linear time - branching time spectrum , 1990 .

[28]  Guy Leduc On the role of implementation relations in the design of distributed systems using LOTOS , 1991 .

[29]  Kim G. Larsen A Context Dependent Equivalence Between Processes , 1987, Theor. Comput. Sci..

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

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