Model Checking Branching Properties on Petri Nets with Transits (Full Version)

07/14/2020
by   Bernd Finkbeiner, et al.
0

To model check concurrent systems, it is convenient to distinguish between the data flow and the control. Correctness is specified on the level of data flow whereas the system is configured on the level of control. Petri nets with transits and Flow-LTL are a corresponding formalism. In Flow-LTL, both the correctness of the data flow and assumptions on fairness and maximality for the control are expressed in linear time. So far, branching behavior cannot be specified for Petri nets with transits. In this paper, we introduce Flow-CTL* to express the intended branching behavior of the data flow while maintaining LTL for fairness and maximality assumptions on the control. We encode physical access control with policy updates as Petri nets with transits and give standard requirements in Flow-CTL*. For model checking, we reduce the model checking problem of Petri nets with transits against Flow-CTL* via automata constructions to the model checking problem of Petri nets against LTL. Thereby, physical access control with policy updates under fairness assumptions for an unbounded number of people can be verified.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2020

AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL (Full Version)

The correctness of networks is often described in terms of the individua...
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
11/03/2021

Fair Mutual Exclusion for N Processes (extended version)

Peterson's mutual exclusion algorithm for two processes has been general...
research
04/12/2022

Methods for Efficient Unfolding of Colored Petri Nets

Colored Petri nets offer a compact and user friendly representation of t...
research
03/29/2021

A Web Interface for Petri Nets with Transits and Petri Games

Developing algorithms for distributed systems is an error-prone task. Fo...
research
03/20/2020

MCC: a Tool for Unfolding Colored Petri Nets in PNML Format

MCC is a tool designed for a very specific task: to transform the models...
research
07/11/2023

Introducing Asynchronicity to Probabilistic Hyperproperties

Probabilistic hyperproperties express probabilistic relations between di...

Please sign up or login with your details

Forgot password? Click here to reset