Syntactical Colored Petri Nets Reductions

Évangelista, Sami; Haddad, Serge; Pradat-Peyre, Jean-François

doi:10.1007/11562948_17

Cited by 20 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It would be also interesting to develop a high-level language to specify the properties to be model-checked. The use of CPNs opens the door to other useful techniques, such optimizing the CPN [5] and translating such optimizations into QVT, or the verification of properties independently of the marking. We also plan to complement our analysis techniques with the automatic generation of initial markings for the nets.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Formal Support for QVT-Relations with Coloured Petri Nets

Lara

Guerra

2009

Model Driven Engineering Languages and Systems

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract. QVT is the OMG standard language for specifying modelto-model transformations in MDA. Even though it plays a crucial role in model driven development, there are scarce tools supporting the execution of its sublanguage QVT-Relations, and none for its analysis or verification. In order to alleviate this situation, this paper provides a formal semantics for QVT-Relations through its compilation into Coloured Petri nets, enabling the execution and validation of QVT specifications. The theory of Petri nets provides useful techniques to analyse transformations (e.g. reachability, model-checking, boundedness and invariants) and to determine their confluence and termination given a starting model. We also report on using CPNTools for the execution, debugging, and analysis of transformations, and on a tool chain to transform QVTRelations specifications into the input format of CPNTools.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Thus, we can check whether for a TinyUML model without attributes it is an invariant that no column is generated. These invariants are called synchronization invariants [5] and can be automatically computed. Model Checking.…”

Section: Verificationmentioning

confidence: 99%

Formal Support for QVT-Relations with Coloured Petri Nets

Lara

Guerra

2009

Model Driven Engineering Languages and Systems

View full text Add to dashboard Cite

show abstract

“…This one consists of finding for a given color c and a color mapping f the set of colors c such that f (c )(c) > 0. Different methods have been proposed in the literature to address this problem in an efficient way (e.g., [6], [1], [2], [8]) for Well Formed nets or similar classes. Even for this formalism, the problem is quite hard, and the solutions proposed either extend the formalism [2] or add some extra restrictions on arc functions [8].…”

Section: Reversing Color Mappingsmentioning

confidence: 99%

On the Computation of Stubborn Sets of Colored Petri Nets

Évangelista

Pradat-Peyre

2006

Petri Nets and Other Models of Concurrency - ICATPN 2006

View full text Add to dashboard Cite

Abstract. Valmari's Stubborn Sets method is a member of the so-called partial order methods. These techniques are usually based on a selective search algorithm: at each state processed during the search, a stubborn set is calculated and only the enabled transitions of this set are used to generate the successors of the state. The computation of stubborn sets requires to detect dependencies between transitions in terms of conflict and causality. In colored Petri nets these dependencies are difficult to detect because of the color mappings present on the arcs: conflicts and causality connections depend on the structure of the net but also on these mappings. Thus, tools that implement this technique usually unfold the net before exploring the state space, an operation that is often untractable in practice. We present in this work an alternative method which avoids the cost of unfolding the net. To allow this, we use a syntactically restricted class of colored nets. Note that this class still enables wide modeling facilities since it is the one used in our model checker Helena which has been designed to support the verification of software specifications. The algorithm presented has been implemented and several experiments which show the benefits of our approach are reported. For several models we obtain a reduction close or even equal to the one obtained after an unfolding of the net. We were also able to efficiently reduce the state spaces of several models obtained by an automatic translation of concurrent software.

show abstract

“…These mathematically sound graphical languages feature several different algorithms for studying interesting properties of systems. The analysis of HLPN models is usually performed through simulation or state space exploration techniques (e.g., model checking), but it can also work on their graph structure: structural analysis can be performed preliminarily to state space generation (e.g., to ensure boundedness), as a quick check for (un)desired behaviours (e.g., livelocks), as a model reduction technique [4] or as a support to specification of model parameters in stochastic HLPN (detecting potentially conflicting transitions [2] is a prerequisite for a correct parameters setting). Finally, structural information can significantly improve the efficiency of both simulation and state space generation.…”

Section: Introductionmentioning

confidence: 99%

A tool for symbolic manipulation of arc functions in Symmetric Net models

Capra¹,

Pierro²,

Franceschinis³

2014

Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

The computation of structural properties of models expressed with the Symmetric Nets formalism (formerly Well-Formed Nets, a High Level Petri Net formalism), their structural reduction, or the efficient detection of transition instances enabled in a given state can benefit from the availability of a calculus for symbolic manipulation of arc functions. In previous works the theoretical basis of such calculus has been presented. In this paper a library implementing the calculus is described, and its use is demonstrated on a simple distributed system model.

show abstract

Syntactical Colored Petri Nets Reductions

Cited by 20 publications

References 14 publications

Formal Support for QVT-Relations with Coloured Petri Nets

Formal Support for QVT-Relations with Coloured Petri Nets

On the Computation of Stubborn Sets of Colored Petri Nets

A tool for symbolic manipulation of arc functions in Symmetric Net models

Contact Info

Product

Resources

About