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} }
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
Figures and Topics from this paper
58 Citations
Minimization of large state spaces using symbolic branching bisimulation
- Computer Science
- 2006 IEEE Design and Diagnostics of Electronic Circuits and systems
- 2006
- 12
- PDF
Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs
- Mathematics, Computer Science
- MMB
- 1999
- 10
Weak bisimulation for Probabilistic Timed Automata
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2010
- 15
- PDF
Model-checking large structured Markov chains
- Computer Science
- J. Log. Algebraic Methods Program.
- 2003
- 56
- PDF
Deriving Symbolic Representations from Stochastic Process Algebras
- Computer Science
- PAPM-PROBMIV
- 2002
- 18
Differential Bisimulation for a Markovian Process Algebra
- Mathematics, Computer Science
- MFCS
- 2015
- 15
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 46 REFERENCES
Computing Bisimulations for Stochastic Process Algebras using Symbolic Representations
- Mathematics
- 1998
- 2
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
- Mathematics, Computer Science
- ICALP
- 1990
- 233
- PDF
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)
- Mathematics, Computer Science
- CONCUR
- 1998
- 18
- PDF
Technique and tool for symbolic representation and manipulation of stochastic transition systems
- Mathematics
- Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248)
- 1998
- 10