Probabilistic Congruence for Semistochastic Generative Processes

We propose an SOS transition rule format for the generative model of probabilistic processes. Transition rules are partitioned in several strata, giving rise to an ordering relation analogous to those introduced by Ulidowski and Phillips for classic process algebras. Our rule format guarantees that probabilistic bisimulation is a congruence w.r.t. process algebra operations. Moreover, our rule format guarantees that process algebra operations preserve semistochasticity of processes, i.e. the property that the sum of the probability of the moves of any process is either 0 or 1. Finally, we show that most of operations of the probabilistic process algebras studied in the literature are captured by our format, which, therefore, has practical applications.

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

[2]  Falk Bartels,et al.  GSOS for Probabilistic Transition Systems , 2002, CMCS.

[3]  Simone Tini,et al.  Rule Formats for Non Interference , 2003, ESOP.

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

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

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

[7]  Irek Ulidowski,et al.  Ordered SOS process languages for branching and Eager bisimulation , 2002 .

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

[9]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

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

[11]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[12]  Joost-Pieter Katoen,et al.  On Generative Parallel Composition , 1998, PROBMIV.

[13]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[14]  Mario Bravetti,et al.  Discrete time generative-reactive probabilistic processes with different advancing speeds , 2003, Theor. Comput. Sci..

[15]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[16]  Mario Bravetti,et al.  A Process Algebraic Approach for the Analysis of Probabilistic Non-interference , 2011 .

[17]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[18]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[19]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[20]  Simone Tini,et al.  Rule formats for compositional non-interference properties , 2004, J. Log. Algebraic Methods Program..