Mixing Up Nondeterminism and Probability: a preliminary report

For a process language with both nondeterministic and probabilistic choice, and a form of failure a transition system is given from which, in a modular way, various operational models corresponding to various interpretations of nondeterminism and probability can be obtained. The effect of failure of one component for the system as a whole is treated differently in each interpretation. The same approach is followed for an extension of the language with a parallel operator. The adopted concurrency model is of a distributed nature and assumes that progress is guaranteed if nonfailing components exist. To this end the notion of a take-over of a failing component is incorporated in the transition system. It is shown that the modular way in which the transition system can yield different semantical models applies to this setting as well.

[1]  Abbas Edalat,et al.  Bisimulation for labelled Markov processes , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[2]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[3]  Annabelle McIver,et al.  Probabilistic Models for the Guarded Command Language , 1997, Sci. Comput. Program..

[4]  Abbas Edalat.  Domain Theory and Integration , 1995, Theor. Comput. Sci..

[5]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[6]  Marta Z. Kwiatkowska,et al.  Probabilistic Metric Semantics for a Simple Language with Recursion , 1996, MFCS.

[7]  den Ji Jerry Hartog.  Comparative semantics for a process language with probabilistic choice and non-determinism , 1998 .

[8]  Gavin Lowe,et al.  Representing Nondeterministic and Probabilistic Behaviour in Reactive Processes , 1993 .

[9]  C. Jones,et al.  A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[10]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, Theor. Comput. Sci..

[11]  Jan J. M. M. Rutten,et al.  Contractions in Comparing Concurrent Semantics , 1988, ICALP.

[12]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[13]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[14]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

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

[16]  Joost-Pieter Katoen,et al.  A Stochastic Automata Model and its Algebraic Approach , 1997 .

[17]  Jan A. Bergstra,et al.  Process Algebra with Partial Choice , 1994, CONCUR.

[18]  Erik P. de Vink,et al.  Control flow semantics , 1996 .

[19]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

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

[21]  Karen Seidel,et al.  Probabilistic Communicating Processes , 1992, Theor. Comput. Sci..