An Efficient Kronecker Representation for PEPA Models

Jane Hillston, Leïla Kloul

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper we present a representation of the Markov process underlying a PEP A 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.
Original languageEnglish
Title of host publicationProcess Algebra and Probabilistic Methods. Performance Modelling and Verification
Subtitle of host publicationJoint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings
EditorsLuca de Alfaro, Stephen Gilmore
PublisherSpringer Berlin Heidelberg
Number of pages16
ISBN (Electronic)978-3-540-44804-4
ISBN (Print)978-3-540-42556-4
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg


Dive into the research topics of 'An Efficient Kronecker Representation for PEPA Models'. Together they form a unique fingerprint.

Cite this