Exploiting stochastic process algebra achievements for generalized stochastic Petri nets

Hermanns, Holger; Herzog, Ulrich; Mertsiotakis, Vassilis; Rettelbach, Michael

doi:10.1109/pnpm.1997.595549

Cited by 11 publications

(13 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have taken up earlier thoughts on nondeterministic GSPN semantics [37] to come up with an IMC semantics for GSPNs. Actually, this semantics is not more than a reinterpretation of the marking graph as an IMC.…”

Section: Examplementioning

confidence: 99%

The How and Why of Interactive Markov Chains

Hermanns

Katoen

2010

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs are closed under parallel composition and hiding, and show how IMCs can be compositionally aggregated prior to analysis by e.g., bisimulation minimisation or aggressive abstraction based on simulation pre-congruences. We survey some recent analysis techniques for IMCs, i.e., explaining how measures such as reachability probabilities can be obtained. Finally, we demonstrate that IMCs are a natural (and simple) semantic model for stochastic process algebras and generalised stochastic Petri nets and can be used for engineering formalisms such as AADL and dynamic fault trees.

show abstract

Section: Examplementioning

confidence: 99%

The How and Why of Interactive Markov Chains

Hermanns

Katoen

2010

Formal Methods for Components and Objects

View full text Add to dashboard Cite

show abstract

“…A comparison of the two formalisms [7] concludes that "there is scope for future work incorporating the attractive characteristics of the formalisms ... from one paradigm into the other". Some work has been done in this area in beginning to develop a structural theory for process algebras [11] on the one hand and in importing composition operations from stochastic process algebras into net formalisms on the other [23,15,13]. In contrast the work on PEPA nets aims to use both Petri nets and process algebras together as a single, structured performance modelling formalism.…”

Section: Related Workmentioning

confidence: 99%

PEPA Nets

Gilmore

Hillston

Kloul

2004

Performance Tools and Applications to Networked Systems

View full text Add to dashboard Cite

Abstract. In this chapter we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way, the net is used to provide a structure for linking related PEPA systems. The combined modelling language naturally represents such applications as mobile code systems where the PEPA terms are used to model the program code which moves between network hosts (the places in the net). We demonstrate the modelling capabilities of the formalism on a number of examples, including a mobile server running MobileIP.

show abstract

“…Two states of a Markov chain are lumpable if they have the same cumulative rate of reaching pairwise lumpable states [44]. Markovian bisimulation reflects lumpability and bisimulation on timed transitions, by imposing constraints on actions and rates, see [30] or [11,36] for details. Weak Markovian bisimulation additionally allows abstraction from internal immediate actions, in analogy to ordinary weak bisimulation [31].…”

Section: Bisimulation and Compositional Analysismentioning

confidence: 99%

“…When synchronising on timed actions, we define the resulting rate to be the product of the two partner rates. This definition preserves compositionality [27,30]. The intuition of the remaining operators is as follows: stop represents an inactive process, i.e., a process which cannot perform any action.…”

Section: Basic Operatorsmentioning

confidence: 99%

Compositional Performance Modelling with the TIPPtool

Hermanns

Herzog

Klehmet

et al. 1998

Computer Performance Evaluation

Self Cite

View full text Add to dashboard Cite

Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations.

show abstract

Exploiting stochastic process algebra achievements for generalized stochastic Petri nets

Cited by 11 publications

References 15 publications

The How and Why of Interactive Markov Chains

The How and Why of Interactive Markov Chains

PEPA Nets

Compositional Performance Modelling with the TIPPtool

Contact Info

Product

Resources

About