A High Level Language for Structural Relations in Well-Formed Nets

Capra, Lorenzo; Pierro, Massimiliano De; Franceschinis, Giuliana

doi:10.1007/11494744_11

Cited by 16 publications

(20 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A detailed description of these rules can be found in [2], where the difference, intersection, transpose operators rewriting rules have been first introduced.…”

Section: The Languagementioning

confidence: 99%

“…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%

See 1 more Smart Citation

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

Self Cite

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

“…A detailed description of these rules can be found in [2], where the difference, intersection, transpose operators rewriting rules have been first introduced.…”

Section: The Languagementioning

confidence: 99%

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

Self Cite

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

“…Exploiting a calculus recently presented in [4] the technique is generalized to comprise all SWN features and this is done symbolically, i.e. without unfolding SWN nodes.…”

Section: A Enabling Test In Swnmentioning

confidence: 99%

“…In addition to the effective state-space based analysis techniques exploiting symmetries, typical of SWN [3], an algebraic calculus have been recently proposed [4] which allows some common tasks of SWN's analysis algorithms to be developed in an efficient way taking advantage of structural considerations. In [5] in particular the SWN calculus has been used to define an algorithm for finding enabled instances of a colored transition in a given marking without any unfolding.…”

Section: Introductionmentioning

confidence: 99%

Integrating Symmetries And Symbolic Enabling Test For Efficient Simulation Of SWNs

Capra¹

2007

ECMS 2007 Proceedings Edited By: I. Zelinka, Z. Oplatkova, A. Orsoni

View full text Add to dashboard Cite

Abstract-(Stochastic) Colored Petri Nets are a formalism widely used to specify and analyze distributed discrete-event systems. Determining the set of transition color instances enabled in a given marking is a basic task affecting analysis techniques based on state-space exploration, model-checking, and especially discreteevent simulation (the latter is an interesting alternative when analytical solutions are unfeasible due to statespace explosion). An algebraic approach to enabling test has been recently proposed as kernel for efficient state-space exploration of SWN, a Stochastic CPN flavor retaining expressive power. The approach is symbolic because it directly manipulates arc functions by means of rewriting rules. What makes interesting the SWN formalism is the ability of exploiting behavioral system's symmetries, thanks to structured color annotations. This paper illustrates in a semi-formal way how the symmetry-based technique typical of SWN can be profitably combined with the SWN symbolic enabling test, giving rise to a fully symbolic simulation kernel. An application example to a workflow model is presented.

show abstract

A High Level Language for Structural Relations in Well-Formed Nets

Cited by 16 publications

References 4 publications

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

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

On the Computation of Stubborn Sets of Colored Petri Nets

Integrating Symmetries And Symbolic Enabling Test For Efficient Simulation Of SWNs

Contact Info

Product

Resources

About