2006
DOI: 10.1007/11767589_9
|View full text |Cite
|
Sign up to set email alerts
|

On the Computation of Stubborn Sets of Colored Petri Nets

Abstract: 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 b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…In this section, we refer to the concept of colour mapping proposed by Sami Evangelista (Evangelista and Pradat-Peyre, 2006), and lay the theoretical foundation for the later section in this paper.…”
Section: Work Basismentioning
confidence: 99%
“…In this section, we refer to the concept of colour mapping proposed by Sami Evangelista (Evangelista and Pradat-Peyre, 2006), and lay the theoretical foundation for the later section in this paper.…”
Section: Work Basismentioning
confidence: 99%