GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets

Chiola, Giovanni; Franceschinis, Giuliana; Gaeta, Rossano; Ribaudo, Marina

doi:10.1016/0166-5316(95)00008-l

Cited by 189 publications

(63 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Evaluation of a GSPN proceeds at the level of the reachability graph. That graph is reduced to a continuous-time Markov chain (CTMC), for which efficient steady-state and transient solvers are at hand [14,17]. Due to their formality, visual representation, and the availability of efficient evaluation support, GSPNs have found widespread application in many diverse disciplines, including manufacturing, logistics, systems biology and so on [11,50,43,24].…”

Section: Introductionmentioning

confidence: 99%

Concurrency and Composition in a Stochastic World

Eisentraut

Hermanns

Zhang

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

Abstract. We discuss conceptional and foundational aspects of Markov automata [22]. We place this model in the context of continuous-and discrete-time Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give a detailled account of the concept of relations on distributions, and discuss how this can generalise known notions of weak simulation and bisimulation, such as to fuse sequences of internal transitions.

show abstract

Section: Introductionmentioning

confidence: 99%

Concurrency and Composition in a Stochastic World

Eisentraut

Hermanns

Zhang

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…In particular, we have addressed a major topic related to recognizing equivalent system's evolutions, through the WN's symbolic state notion. We are planning to integrate the GreatSPN tool (Chiola, Franceschinis, Gaeta and Ribaudo, 1995), that natively supports WN (and their stochastic extension, SWN), with new modules (plug-in's) for the graphical editing and the analysis/simulation of reflective Petri net models. We are studying the possibility of defining a timed semantics for Reflective Petri nets, which should be in large part inspired by SWN (GSPN) timed semantics.…”

Section: Resultsmentioning

confidence: 99%

Evolving System’s Modeling and Simulation through Reflective Petri Nets

Capra

Cazzola

2009

Proceedings of the 4th International Conference on Evaluation of Novel Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. The design of dynamic discrete-event systems calls for adequate modeling formalisms and tools to manage possible changes occurring during system's lifecycle. A common approach is to pollute design with details that do not regard the current system behavior rather its evolution. That hampers analysis, reuse and maintenance in general. A reflective Petri net model (based on classical Petri nets) was recently proposed to support dynamic discrete-event system's design, and was applied to dynamic workflow's management. Behind there is the idea that keeping functional aspects separated from evolutionary ones and applying them to the (current) system only when necessary, results in a simple formal model on which the ability of verifying properties typical of Petri nets is preserved. In this paper we provide the reflective Petri nets with a (labeled)

show abstract

“…That graph is transformed into a CTMC, for which efficient steady-state and transient solvers are at hand. This evaluation trajectory was pioneered by the tool GreatSPN [20], nowadays it is implemented in a plethora of tools.…”

Section: Examplementioning

confidence: 99%

The How and Why of Interactive Markov Chains

Hermanns

Katoen

2010

Lecture Notes in Computer Science

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

GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets

Cited by 189 publications

References 6 publications

Concurrency and Composition in a Stochastic World

Concurrency and Composition in a Stochastic World

Evolving System’s Modeling and Simulation through Reflective Petri Nets

The How and Why of Interactive Markov Chains

Contact Info

Product

Resources

About