Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation

@inproceedings{Hermanns1999BisimulationAF,
  title={Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation},
  author={H. Hermanns and M. Siegle},
  booktitle={ARTS},
  year={1999}
}
  • H. Hermanns, M. Siegle
  • Published in ARTS 1999
  • Computer Science
  • Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addresses the computational complexity of minimisation algorithms and explains how efficient, BDD-based… CONTINUE READING
    58 Citations
    Symbolic Minimisation of Stochastic Process Algebra Models
    Minimization of large state spaces using symbolic branching bisimulation
    • 12
    • PDF
    Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs
    • M. Siegle
    • Mathematics, Computer Science
    • MMB
    • 1999
    • 10
    Rate-Based Transition Systems for Stochastic Process Calculi
    • 44
    • PDF
    Symbolic semantics and verification of stochastic process algebras
    • 14
    • PDF
    Weak bisimulation for Probabilistic Timed Automata
    • 15
    • PDF
    Model-checking large structured Markov chains
    • 56
    • PDF
    Deriving Symbolic Representations from Stochastic Process Algebras
    • 18
    Differential Bisimulation for a Markovian Process Algebra
    • 15
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 46 REFERENCES
    Computing Bisimulations for Stochastic Process Algebras using Symbolic Representations
    • 2
    Stochastic Process Algebras - Between LOTOS and Markov Chains
    • 86
    Weak Bisimulation for Fully Probabilistic Processes
    • 168
    • PDF
    Syntax , Semantics , Equivalences , and Axioms for MTIPP y
    • 144
    Bisimulation through Probabilistic Testing
    • 1,259
    Branching time and abstraction in bisimulation semantics
    • 800
    • PDF
    An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
    • 233
    • PDF
    Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)
    • 18
    • PDF
    Technique and tool for symbolic representation and manipulation of stochastic transition systems
    • M. Siegle
    • Mathematics
    • Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248)
    • 1998
    • 10
    Priority and maximal progress are completely axiomatisable
    • 17