A symbolic reachability graph for coloured petri nets

Chiola, Giovanni; Dutheillet, Claude; Franceschinis, Giuliana; Haddad, Serge

doi:10.1016/s0304-3975(96)00010-2

Cited by 76 publications

(35 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The formalisms employed for the two layers (meta-and base-level) of the reflective layout are Well-formed Nets (WN) (Chiola, Dutheillet, Franceschinis and Haddad, 1997), a flavor of Colored Petri nets (CPN) (Jensen and Rozenberg, 1991), and their unfolding, an extension of ordinary Place/Transition nets (Reisig, 1985) respectively. This choice has revealed convenient for two main reasons: i) the behavior of reflective Petri nets can be formally stated in terms of classical Petri nets; ii) the symbolic state representation the WN formalism is provided with leads to an effective state-transition semantics for Reflective Petri nets, in which the intriguing question related to recognition of equivalent evolutions is efficiently handled.ding, an extension of ordinary Place/Transition nets (Reisig, 1985) respectively.…”

Section: Wn Basicsmentioning

confidence: 99%

“…The definition of a SM (denoted b M) (Chiola et al, 1997) comprises two parts specifying the so called dynamic subclasses and the distribution of colored symbolic tokens (tuples built of dynamic subclasses) over the net places, respectively.…”

Section: The Symbolic Marking (Sm) Notionmentioning

confidence: 99%

“…Among several possible equivalent representations, the canonical representative (Chiola et al, 1997) provides SM with a univocal formal expression, based on a lexicographic ordering of dynamic subclass distribution over the net places.…”

Section: The Symbolic Marking (Sm) Notionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Wn Basicsmentioning

confidence: 99%

Section: The Symbolic Marking (Sm) Notionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…The semantics of a model is then easily obtained by translating a MDWN into a MDPN. Furthermore, we develop an alternative approach: we transform the MDWN into a WN, then we build the symbolic reachability graph of this net [5] and finally we transform this graph into a reduced MDP w.r.t. the original one.…”

Section: Introductionmentioning

confidence: 99%

Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms

Beccuti

Franceschinis

Haddad

2007

Petri Nets and Other Models of Concurrency – ICATPN 2007

Self Cite

View full text Add to dashboard Cite

Abstract. In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distributed systems with probabilistic and non deterministic features: these formalisms allow a high level representation of Markov Decision Processes. The main advantages of both formalisms are: a macroscopic point of view of the alternation between the probabilistic and the non deterministic behaviour of the system and a syntactical way to define the switch between the two behaviours. Furthermore, MDWNs enable the modeller to specify in a concise way similar components. We have also adapted the technique of the symbolic reachability graph, originally designed for Well-formed Nets, producing a reduced Markov decision process w.r.t. the original one, on which the analysis may be performed more efficiently. Our new formalisms and analysis methods are already implemented and partially integrated in the GreatSPN tool, so we also describe some experimental results.

show abstract

“…Well Formed nets (WN) [2] are a class of HLPN that allows automatic generation of a Symbolic Reachability Graph (SRG) [3]. An SRG allows compact representation of the state-space by defining classes of equivalent concrete accessible states.…”

Section: Introductionmentioning

confidence: 99%

Automatic Symmetry Detection in Well-Formed Nets

Thierry-Mieg

Dutheillet

Mounier

2003

Applications and Theory of Petri Nets 2003

View full text Add to dashboard Cite

Abstract. Formal verification of complex systems using high-level Petri Nets faces the so-called state-space explosion problem. In the context of Petri nets generated from a higher level specification, this problem is particularly acute due to the inherent size of the considered models. A solution is to perform a symbolic analysis of the reachability graph, which exploits the symmetry of a model. Well-Formed Nets (WN) are a class of high-level Petri nets, developed specifically to allow automatic construction of a symbolic reachability graph (SRG), that represents equivalence classes of states. This relies on the definition by the modeler of the symmetries of the model, through the definition of "static sub-classes". Since a model is self-contained, these (a)symmetries are actually defined by the model itself. This paper presents an algorithm capable of automatically extracting the symmetries inherent to a model, thus allowing its symbolic study by translating it to WN. The computation starts from the assumption that the model is entirely symmetric, then examines each component of a net to deduce the symmetry break it induces. This translation is transparent to the end-user, and is implemented as a service for the AMI-Net package. It is particularly adapted to models containing large value domains, yielding combinatorial gain in the size of the reachability graph.

show abstract

A symbolic reachability graph for coloured petri nets

Cited by 76 publications

References 3 publications

Evolving System’s Modeling and Simulation through Reflective Petri Nets

Evolving System’s Modeling and Simulation through Reflective Petri Nets

Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms

Automatic Symmetry Detection in Well-Formed Nets

Contact Info

Product

Resources

About