Obtaining deadlock-preserving skeletons for coloured nets

Findlow, Greg

doi:10.1007/3-540-55676-1_10

Cited by 2 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of a skeleton-based analysis of a Petri net is subject of [Vau87]. Based on this, [Fin92] examines the role of deadlocks within this topic more precisely. The results are also applied in other contexts.…”

Section: Related Workmentioning

confidence: 99%

“…With the skeleton of a Pr/T-Net, properties like reachability of states or deadlock freeness can be examined. [Lil95] transfers Findlow's results [Fin92] to algebraic nets. They are used as an application for a folding construction, which is described there.…”

Section: Related Workmentioning

confidence: 99%

“…The reachability graph of this net is not readily a Kripke structure, hence all deadlock states were extended with a self loop with a silent action. In [Fin92], two necessary and sufficient criteria are formulated, defining a class of coloured Petri nets which have a deadlock-preserving skeleton.…”

Section: Deadlock Preservationmentioning

confidence: 99%

“…This leads to the following lemma: Lemma 5.3. (Deadlock-Preserving Skeleton [Fin92]) Let C be a uniform, coloured Petri net. Iff every minimal transition class of C regarding (T C / ∼ , ≤) is full, then C has a deadlock-preserving skeleton.…”

Section: Deadlock Preservationmentioning

confidence: 99%

See 3 more Smart Citations

Skeleton Abstraction for Universal Temporal Properties

Wallner¹,

Wolf²

2021

Preprint

View full text Add to dashboard Cite

Uniform coloured Petri nets can be abstracted to their skeleton, the place/transition net that simply turns the coloured tokens into black tokens. A coloured net and its skeleton are related by a net morphism [Des91, PGE98]. For the application of the skeleton as an abstraction method in the model checking process, we need to establish a simulation relation [Mil89] between the state spaces of the two nets. Then, universal temporal properties (properties of the ACT L * logic) are preserved. The abstraction relation induced by a net morphism is not necessarily a simulation relation, due to a subtle issue related to deadlocks [Fin92]. We discuss several situations where the abstraction relation induced by a net morphism is as well a simulation relation, thus preserving ACT L * properties. We further propose a partition refinement algorithm for folding a place/transition net into a coloured net. This way, skeleton abstraction becomes available for models given as place/transition nets. Experiments demonstrate the capabilities of the proposed technology. Using skeleton abstraction, we are capable of solving problems that have not been solved before in the Model Checking Contest [KGH + 19].

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Deadlock Preservationmentioning

confidence: 99%

Section: Deadlock Preservationmentioning

confidence: 99%

See 2 more Smart Citations