Petri Net, Theory and Applications 2008
DOI: 10.5772/5328
|View full text |Cite
|
Sign up to set email alerts
|

Using Transition Invariants for Reachability Analysis of Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…Then, one can apply an efficient enumeration scheme to find all the relevant FCVs, based on the following two features: i) an ILP formulation to characterize the admissible FCVs of maximum length K, and ii) a Branch & Bound (B&B) procedure that partitions the solution space once a solution is found, introducing suitable constraints to exclude previously found solutions. Notice that, differently from the approach of [25], where the existence of fireable TSs compatible with the calculated FCVs is verified a posteriori, here the admissibility check is integrated in the enumeration procedure, to avoid carrying over useless FCVs to the -more costly-timed analysis.…”
Section: A Finiteness Of the Fcvsmentioning
confidence: 99%
See 2 more Smart Citations
“…Then, one can apply an efficient enumeration scheme to find all the relevant FCVs, based on the following two features: i) an ILP formulation to characterize the admissible FCVs of maximum length K, and ii) a Branch & Bound (B&B) procedure that partitions the solution space once a solution is found, introducing suitable constraints to exclude previously found solutions. Notice that, differently from the approach of [25], where the existence of fireable TSs compatible with the calculated FCVs is verified a posteriori, here the admissibility check is integrated in the enumeration procedure, to avoid carrying over useless FCVs to the -more costly-timed analysis.…”
Section: A Finiteness Of the Fcvsmentioning
confidence: 99%
“…The set of vectors y = Consider e.g. the PN system depicted in Figure 2 [25], for which we want to solve the reachability problem from m 0 = 2p 1 to m t = 2p 1 +p 9 with K = 25. The set of MS T-invariants of the complemented net is given by Y ms = {y 1 , y 2 , y 3 }, where y 1 = [0 0 1 1 1 0 1 0 0 0 0] T , y 2 = [1 1 0 0 0 1 1 0 0 0 0] T , and y 3 = [0 0 0 0 0 0 0 1 1 1 1] T .…”
Section: B An Ilp Formulation To Characterize Admissible Fcvsmentioning
confidence: 99%
See 1 more Smart Citation
“…A PN is a mathematical model for representation and analysis of concurrent processes [18]. The problem of whether some arbitrary state is reachable from a fixed initial state of a PN is of basic importance in the field of computer science [19][20][21][22][23][24][25]. PNs enable modeling in a multi-modal way, ranging from semi-quantitative to detailed quantitative modeling.…”
Section: Introductionmentioning
confidence: 99%
“…Reference [5] mainly analyzes the correctness in Web service composition. Reference [6][7] analyzes the accessibility of the web by T-invariant. The existed modeling methods is not perfect.…”
Section: Introductionmentioning
confidence: 99%