Skeleton Abstraction for Universal Temporal Properties

12/16/2021
by   Sophie Wallner, et al.
0

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. For the application of the skeleton as an abstraction method in the model checking process, we need to establish a simulation relation between the state spaces of the two nets. Then, universal temporal properties (properties of the ACTL^* 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. We discuss several situations where the abstraction relation induced by a net morphism is as well a simulation relation, thus preserving ACTL^* 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2020

Logic Signed Petri Net

In this paper,the authors show the versatility of the Signed Petri Net (...
research
09/13/2022

Bounded Model Checking for Unbounded Client Server Systems

Bounded model checking (BMC) is an efficient formal verification techniq...
research
07/25/2019

Model Checking Data Flows in Concurrent Network Updates (Full Version)

We present a model checking approach for the verification of data flow c...
research
08/24/2013

Evolution Theory of Self-Evolving Autonomous Problem Solving Systems

The present study gives a mathematical framework for self-evolution with...
research
08/06/2014

The Mathematical Abstraction Theory, The Fundamentals for Knowledge Representation and Self-Evolving Autonomous Problem Solving Systems

The intention of the present study is to establish the mathematical fund...
research
06/21/2018

Universal Safety for Timed Petri Nets is PSPACE-complete

A timed network consists of an arbitrary number of initially identical 1...
research
03/02/2022

Theoretical Foundation of Colored Petri Net through an Analysis of their Markings as Multi-classification

Barwise and Seligman stated the first principle of information flow: "In...

Please sign up or login with your details

Forgot password? Click here to reset