Formal Characterisation of Immediate Actions in SPA with Nondeterministic Branching

Stochastic Process Algebras (SPA) are process algebras in which the duration of each activity is given by a random variable. If the stochastic aspect is restricted to Markovian, i.e. exponentially distributed durations, nice algebraic foundations are available. They include a formal semantics and an equational theory for Markovian bisimulation, a congruence that can be seen as a stochastic counterpart of strong bisimulation. This paper extends that theory with a stochastic notion of Milner's observational congruence. We enrich a basic SPA with immediate actions that happen instantaneously if enabled. For the enriched calculus we will derive a sound and complete characterisation of Markovian observational congruence, a conservative extension of both Markovian bisimulation and observational congruence. The usefulness of immediate actions together with their equational theory will be illustrated by means of an example. Additionally, we will discuss some implementation and modelling issues arising from our results.

[1]  Norbert Götz,et al.  Stochastische Prozessalgebren: Integration von funktionalem Entwurf und Leistungsbewertung Verteilter Systeme , 1994 .

[2]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[3]  Paola Inverardi,et al.  Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting , 1995, Theor. Comput. Sci..

[4]  H. Hermanns,et al.  Syntax , Semantics , Equivalences , and Axioms for MTIPP y , 1994 .

[5]  Norbert Götz,et al.  Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras , 1993, Performance/SIGMETRICS Tutorials.

[6]  Jane Hillston.  Proceedings of the 2nd Workshop on Process Algebra and Performance Modelling , 1994 .

[7]  Michael Rettelbach.  Probabilistic Branching in Markovian Process Algebras , 1995, Comput. J..

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

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

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

[11]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[12]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

[13]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[14]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[15]  Roberto Gorrieri,et al.  MPA: a Stochastic Process Algebra , 1994 .

[16]  M. Siegle,et al.  Compositional Minimal Semantics for the Stochastic Process Algebra TIPP , 1994 .

[17]  Marco Ajmone Marsan,et al.  Performance models of multiprocessor systems , 1987, MIT Press series in computer systems.