For the most recent entries see the Petri Nets Newsletter.

An Efficient Kronecker Representation for PEPA Models.

Hillston, Jane; Kloul, Leila

In: LNCS 2165: Process Algebra and Probabilistic Methods - Performance Modeling and Verification, pages 120-pp. Joint International Workshop, PAPM-PROBMIV 2001, Aachen, Germany, September 12-14, 2001, Proceedings / L. de Alfaro, S. Gilmore (Eds.) --- Springer Verlag, 2001.

Abstract: 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.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography