×

zbMATH — the first resource for mathematics

An efficient Kronecker representation for PEPA models. (English) Zbl 1007.68513
De Alfaro, Luca (ed.) et al., Process algebra and probabilistic methods. Performance modelling and verification. Joint international workshop, PAPM-PROBMIV 2001, Aachen, Germany, September 12-14, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2165, 120-135 (2001).
Summary: In this paper we present a representation of the Markov process underlying a PEPA model in terms of a Kronecker product of terms. Whilst this representation is similar to previous representations of Stochastic Automata Networks and Stochastic Petri Nets, it has novel features, arising from the definition of the PEPA models. In particular, capturing the correct timing behaviour of cooperating PEPA activities relies on functional dependencies.
For the entire collection see [Zbl 0971.00028].

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q60 Specification and verification (program logics, model checking, etc.)
Software:
PEPA
PDF BibTeX XML Cite
Full Text: Link