Chapter

Process Algebra and Probabilistic Methods: Performance Modeling and Verification

Volume 2399 of the series Lecture Notes in Computer Science pp 188-206

Date:

Deriving Symbolic Representations from Stochastic Process Algebras

  • Matthias KuntzAffiliated withInstitut für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg
  • , Markus SiegleAffiliated withInstitut für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg

* Final gross prices may vary according to local VAT.

Get Access

Abstract

A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multi-terminal binary decision diagrams. It is shown that the new semantics is Markovian bisimulation equivalent to the standard SOS semantics. The paper also addresses the difficult question of keeping the underlying state space minimal at every construction step.