Log In Sign Up

Universal Safety for Timed Petri Nets is PSPACE-complete

by   Parosh Aziz Abdulla, et al.

A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. We consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network. This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number m of tokens, such that starting with m tokens in a given place, and none in the other places, some given transition is eventually enabled. We show that these problems are PSPACE-complete.


page 1

page 2

page 3

page 4


A Decidable Equivalence for a Turing-complete, Distributed Model of Computation

Place/Transition Petri nets with inhibitor arcs (PTI nets for short), wh...

On detectability of labeled Petri nets with inhibitor arcs

Detectability is a basic property of dynamic systems: when it holds one ...

Distribution-based objectives for Markov Decision Processes

We consider distribution-based objectives for Markov Decision Processes ...

Skeleton Abstraction for Universal Temporal Properties

Uniform coloured Petri nets can be abstracted to their skeleton, the pla...

Synthesis in Distributed Environments

Most approaches to the synthesis of reactive systems study the problem i...

Executions in (Semi-)Integer Petri Nets are Compact Closed Categories

In this work, we analyse Petri nets where places are allowed to have a n...

Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory

In the synthesis of distributed systems, we automate the development of ...