Using Max-Plus Algebra for the Evaluation of Stochastic Process Algebra Prefixes

Authors:
Lucia Cloth;Henrik C. Bohnenkamp;Boudewijn R. Haverkort
Affiliations:
-;-;-
Venue:
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Year:
2001

Citing 4
Cited 0

Symbolic Model Checking

Symbolic Model Checking
An Improvement of McMillan's Unfolding Algorithm

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Throughput Approximation of Decision Free Processes Using Decomposition

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the concept of complete finite prefixes for process algebra expressions is extended to stochastic models. Events are supposed to happen after a delay that is determined by random variables assigned to the preceding conditions. Max-plus algebra expressions are shown to provide an elegant notation for stochastic prefixes not containing any decisions. Furthermore, they allow for the computation of performance measures. The derivation of the so called k-th occurrence times is shown in detail.