Abstract
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 data structures can be employed for this purpose.
Original language | Undefined |
---|---|
Pages | 144-264 |
Number of pages | 121 |
Publication status | Published - 1999 |
Event | Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS'99 - Bamberg, Germany Duration: 1 May 1999 → 1 May 1999 |
Workshop
Workshop | Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS'99 |
---|---|
Period | 1/05/99 → 1/05/99 |
Other | May 1999 |
Keywords
- FMT-PA: PROCESS ALGEBRAS
- FMT-PM: PROBABILISTIC METHODS
- IR-63312
- FMT-BDD: BINARY DECISION DIAGRAMS
- FMT-FMPA: FORMAL METHODS FOR PERFORMANCE ANALYSIS
- EWI-6504