Deriving Symbolic Representations from Stochastic Process Algebras

  • Matthias Kuntz
  • Markus Siegle
Conference paper

DOI: 10.1007/3-540-45605-8_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2399)
Cite this paper as:
Kuntz M., Siegle M. (2002) Deriving Symbolic Representations from Stochastic Process Algebras. In: Hermanns H., Segala R. (eds) Process Algebra and Probabilistic Methods: Performance Modeling and Verification. Lecture Notes in Computer Science, vol 2399. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Matthias Kuntz
    • 1
  • Markus Siegle
    • 1
  1. 1.Institut für InformatikFriedrich-Alexander-Universität Erlangen-NürnbergGermany

Personalised recommendations