GSPNs Revisited: Simple Semantics and New Analysis Algorithms

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

15 Citations (Scopus)

Abstract

This paper considers interactive Markov chains (IMCs), a natural generalization of transition systems and continuous-time Markov chains (CTMCs). We show how they can be used to provide a truly simple semantics of Generalized Stochastic Petri Nets (GSPNs). In fact, any GSPN. In particular, no restrictions are imposed on the concurrent/conflicting enabledness of immediate transitions. This contrasts with classical solutions for GSPNs which use weights. (A simple extension of IMCs also covers weights.) In addition, we will present novel analysis algorithms for expected time and long-run average time objectives of IMCs, i.e., GSPNs. Two case studies indicate the feasibility of these analyses and show that a classical reliability analysis for confused GSPNs may lead to significant over-estimations of the true probabilities. The key message is: nondeterminism is not a threat, treat it as is! This yields both a simple GSPN semantics and trustworthy analysis results.
Original languageUndefined
Title of host publication12th International Conference on Application of Concurrency to System Design, ACSD 2012
Place of PublicationUSA
PublisherIEEE Computer Society
Pages6-11
Number of pages6
ISBN (Print)978-1-4673-1687-3
DOIs
Publication statusPublished - Jun 2012
Event12th International Conference on Application of Concurrency to System Design, ACSD 2012 - Hamburg, Germany
Duration: 27 Jun 201229 Jun 2012
Conference number: 12

Publication series

Name
PublisherIEEE Computer Society
ISSN (Print)1550-4808

Conference

Conference12th International Conference on Application of Concurrency to System Design, ACSD 2012
Abbreviated titleACSD
CountryGermany
CityHamburg
Period27/06/1229/06/12

Keywords

  • EWI-22516
  • METIS-293190
  • IR-82496

Cite this

Katoen, J. P. (2012). GSPNs Revisited: Simple Semantics and New Analysis Algorithms. In 12th International Conference on Application of Concurrency to System Design, ACSD 2012 (pp. 6-11). USA: IEEE Computer Society. https://doi.org/10.1109/ACSD.2012.30
Katoen, Joost P. / GSPNs Revisited: Simple Semantics and New Analysis Algorithms. 12th International Conference on Application of Concurrency to System Design, ACSD 2012. USA : IEEE Computer Society, 2012. pp. 6-11
@inproceedings{51d5f991a9dd421880a5380c7a714324,
title = "GSPNs Revisited: Simple Semantics and New Analysis Algorithms",
abstract = "This paper considers interactive Markov chains (IMCs), a natural generalization of transition systems and continuous-time Markov chains (CTMCs). We show how they can be used to provide a truly simple semantics of Generalized Stochastic Petri Nets (GSPNs). In fact, any GSPN. In particular, no restrictions are imposed on the concurrent/conflicting enabledness of immediate transitions. This contrasts with classical solutions for GSPNs which use weights. (A simple extension of IMCs also covers weights.) In addition, we will present novel analysis algorithms for expected time and long-run average time objectives of IMCs, i.e., GSPNs. Two case studies indicate the feasibility of these analyses and show that a classical reliability analysis for confused GSPNs may lead to significant over-estimations of the true probabilities. The key message is: nondeterminism is not a threat, treat it as is! This yields both a simple GSPN semantics and trustworthy analysis results.",
keywords = "EWI-22516, METIS-293190, IR-82496",
author = "Katoen, {Joost P.}",
note = "10.1109/ACSD.2012.30",
year = "2012",
month = "6",
doi = "10.1109/ACSD.2012.30",
language = "Undefined",
isbn = "978-1-4673-1687-3",
publisher = "IEEE Computer Society",
pages = "6--11",
booktitle = "12th International Conference on Application of Concurrency to System Design, ACSD 2012",
address = "United States",

}

Katoen, JP 2012, GSPNs Revisited: Simple Semantics and New Analysis Algorithms. in 12th International Conference on Application of Concurrency to System Design, ACSD 2012. IEEE Computer Society, USA, pp. 6-11, 12th International Conference on Application of Concurrency to System Design, ACSD 2012, Hamburg, Germany, 27/06/12. https://doi.org/10.1109/ACSD.2012.30

GSPNs Revisited: Simple Semantics and New Analysis Algorithms. / Katoen, Joost P.

12th International Conference on Application of Concurrency to System Design, ACSD 2012. USA : IEEE Computer Society, 2012. p. 6-11.

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

TY - GEN

T1 - GSPNs Revisited: Simple Semantics and New Analysis Algorithms

AU - Katoen, Joost P.

N1 - 10.1109/ACSD.2012.30

PY - 2012/6

Y1 - 2012/6

N2 - This paper considers interactive Markov chains (IMCs), a natural generalization of transition systems and continuous-time Markov chains (CTMCs). We show how they can be used to provide a truly simple semantics of Generalized Stochastic Petri Nets (GSPNs). In fact, any GSPN. In particular, no restrictions are imposed on the concurrent/conflicting enabledness of immediate transitions. This contrasts with classical solutions for GSPNs which use weights. (A simple extension of IMCs also covers weights.) In addition, we will present novel analysis algorithms for expected time and long-run average time objectives of IMCs, i.e., GSPNs. Two case studies indicate the feasibility of these analyses and show that a classical reliability analysis for confused GSPNs may lead to significant over-estimations of the true probabilities. The key message is: nondeterminism is not a threat, treat it as is! This yields both a simple GSPN semantics and trustworthy analysis results.

AB - This paper considers interactive Markov chains (IMCs), a natural generalization of transition systems and continuous-time Markov chains (CTMCs). We show how they can be used to provide a truly simple semantics of Generalized Stochastic Petri Nets (GSPNs). In fact, any GSPN. In particular, no restrictions are imposed on the concurrent/conflicting enabledness of immediate transitions. This contrasts with classical solutions for GSPNs which use weights. (A simple extension of IMCs also covers weights.) In addition, we will present novel analysis algorithms for expected time and long-run average time objectives of IMCs, i.e., GSPNs. Two case studies indicate the feasibility of these analyses and show that a classical reliability analysis for confused GSPNs may lead to significant over-estimations of the true probabilities. The key message is: nondeterminism is not a threat, treat it as is! This yields both a simple GSPN semantics and trustworthy analysis results.

KW - EWI-22516

KW - METIS-293190

KW - IR-82496

U2 - 10.1109/ACSD.2012.30

DO - 10.1109/ACSD.2012.30

M3 - Conference contribution

SN - 978-1-4673-1687-3

SP - 6

EP - 11

BT - 12th International Conference on Application of Concurrency to System Design, ACSD 2012

PB - IEEE Computer Society

CY - USA

ER -

Katoen JP. GSPNs Revisited: Simple Semantics and New Analysis Algorithms. In 12th International Conference on Application of Concurrency to System Design, ACSD 2012. USA: IEEE Computer Society. 2012. p. 6-11 https://doi.org/10.1109/ACSD.2012.30