2005
DOI: 10.1007/11494744_11
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(20 citation statements)
references
References 4 publications
0
20
0
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%
See 1 more Smart Citation
“…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%
“…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%
“…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%