Probabilistic congruence for semistochastic generative processes

  • Authors:

  • Ruggero Lanotte;Simone Tini

  • Affiliations:

  • Dipartimento di Scienze della Cultura, Politiche e dell'Informazione, Università dell'Insubria, Como, Italy;Dipartimento di Scienze della Cultura, Politiche e dell'Informazione, Università dell'Insubria, Como, Italy

  • Venue:
  • FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.