Skeleton Abstraction for Universal Temporal Properties

Wallner, Sophie; Wolf, Karsten

doi:10.1007/978-3-030-76983-3_10

Cited by 1 publication

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While folding, We need to conform the restrictions of uniformity, that building a skeleton is possible. The uniformity criterion used here is more liberal than the one in [WW21]. There, we required that, for every two low level transitions t 1 and t 2 in some transition class, every place class M and every weight k, t 1 and t 2 have the same number of pre-places (resp.…”

Section: Folding Place/transition Netsmentioning

confidence: 99%

“…This paper is an improved version of the conference paper [WW21] and gives a detailed analysis of situations, where the skeleton as an abstraction technique is soundly applicable in the model checking process for coloured Petri nets. It is structured as follows: The next section 2 will give an overview of the application of skeleton nets in other contexts, section 3 provides necessary basic definitions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Skeleton Abstraction for Universal Temporal Properties

Wallner¹,

Wolf²

2021

Preprint

Self Cite

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: Folding Place/transition Netsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%