Petri Nets and Other Models of Concurrency – ICATPN 2007
DOI: 10.1007/978-3-540-73094-1_8
|View full text |Cite
|
Sign up to set email alerts
|

Improving Static Variable Orders Via Invariants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…In a MPS, a weighted sum of tokens is constant in any marking. Therefore, we expect that a variable ordering that groups together MDD variables corresponding to places in the same NU/MPS should reduce the MDD size, due to the inter-dependence between the variables [11,25].…”
Section: Function Sloanmentioning
confidence: 99%
See 3 more Smart Citations
“…In a MPS, a weighted sum of tokens is constant in any marking. Therefore, we expect that a variable ordering that groups together MDD variables corresponding to places in the same NU/MPS should reduce the MDD size, due to the inter-dependence between the variables [11,25].…”
Section: Function Sloanmentioning
confidence: 99%
“…We assume that MDD levels encode Petri net places, i.e. we do not consider merging multiple places into a single level like in [11]. The state space generation algorithms employs saturation [10].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, the efficiency of saturation is also highly dependent on the order of components. There are different heuristics to find a "proper" ordering, such as those introduced in [CLY07,SC06,TMIP04]. The algorithms presented in this paper assume that an ordering is already given.…”
Section: Symbolic Encodingmentioning
confidence: 99%