An Efficient Kronecker Representation for PEPA Models

Jane Hillston; Leïla Kloul

doi:10.1007/3-540-44804-7_8

An Efficient Kronecker Representation for PEPA Models

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English
Title of host publication	Process Algebra and Probabilistic Methods. Performance Modelling and Verification
Subtitle of host publication	Joint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings
Editors	Luca de Alfaro, Stephen Gilmore
Publisher	Springer Berlin Heidelberg
Pages	120-135
Number of pages	16
Volume	2165
ISBN (Electronic)	978-3-540-44804-4
ISBN (Print)	978-3-540-42556-4
DOIs	https://doi.org/10.1007/3-540-44804-7_8
Publication status	Published - 2001

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	2165

Access to Document

10.1007/3-540-44804-7_8

http://dx.doi.org/10.1007/3-540-44804-7_8

Cite this

Hillston, J., & Kloul, L. (2001). An Efficient Kronecker Representation for PEPA Models. In L. de Alfaro, & S. Gilmore (Eds.), Process Algebra and Probabilistic Methods. Performance Modelling and Verification: Joint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings (Vol. 2165, pp. 120-135). (Lecture Notes in Computer Science; Vol. 2165). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44804-7_8

Hillston, Jane ; Kloul, Leïla. / An Efficient Kronecker Representation for PEPA Models. Process Algebra and Probabilistic Methods. Performance Modelling and Verification: Joint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings. editor / Luca de Alfaro ; Stephen Gilmore. Vol. 2165 Springer Berlin Heidelberg, 2001. pp. 120-135 (Lecture Notes in Computer Science).

@inproceedings{b3ada6e118d8449098084a3f5e560e23,

title = "An Efficient Kronecker Representation for PEPA Models",

abstract = "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.",

author = "Jane Hillston and Le{\"i}la Kloul",

year = "2001",

doi = "10.1007/3-540-44804-7_8",

language = "English",

isbn = "978-3-540-42556-4",

volume = "2165",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "120--135",

editor = "{de Alfaro}, Luca and Stephen Gilmore",

booktitle = "Process Algebra and Probabilistic Methods. Performance Modelling and Verification",

}

Hillston, J & Kloul, L 2001, An Efficient Kronecker Representation for PEPA Models. in L de Alfaro & S Gilmore (eds), Process Algebra and Probabilistic Methods. Performance Modelling and Verification: Joint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings. vol. 2165, Lecture Notes in Computer Science, vol. 2165, Springer Berlin Heidelberg, pp. 120-135. https://doi.org/10.1007/3-540-44804-7_8

An Efficient Kronecker Representation for PEPA Models. / Hillston, Jane; Kloul, Leïla.

Process Algebra and Probabilistic Methods. Performance Modelling and Verification: Joint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings. ed. / Luca de Alfaro; Stephen Gilmore. Vol. 2165 Springer Berlin Heidelberg, 2001. p. 120-135 (Lecture Notes in Computer Science; Vol. 2165).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An Efficient Kronecker Representation for PEPA Models

AU - Hillston, Jane

AU - Kloul, Leïla

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-44804-7_8

DO - 10.1007/3-540-44804-7_8

M3 - Conference contribution

SN - 978-3-540-42556-4

VL - 2165

T3 - Lecture Notes in Computer Science

SP - 120

EP - 135

BT - Process Algebra and Probabilistic Methods. Performance Modelling and Verification

A2 - de Alfaro, Luca

A2 - Gilmore, Stephen

PB - Springer Berlin Heidelberg

ER -

Hillston J, Kloul L. An Efficient Kronecker Representation for PEPA Models. In de Alfaro L, Gilmore S, editors, Process Algebra and Probabilistic Methods. Performance Modelling and Verification: Joint International Workshop, PAPM-PROBMIV 2001 Aachen, Germany, September 12–14, 2001 Proceedings. Vol. 2165. Springer Berlin Heidelberg. 2001. p. 120-135. (Lecture Notes in Computer Science). doi: 10.1007/3-540-44804-7_8

An Efficient Kronecker Representation for PEPA Models

Abstract

Publication series

Access to Document

Fingerprint

Cite this