On the Flatness of Immediate Observation Petri Nets

by   Mikhail Raskin, et al.

In a previous paper we introduced immediate observation (IO) Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. We showed that many problems for this class are PSPACE-complete, including parameterized problems asking whether an infinite set of Petri nets with the same underlying net but different initial markings satisfy a given property. The proofs of PSPACE inclusion did not provide explicit algorithms, leaving open the question of practical verification procedures. In the first part of this paper we show that IO Petri nets are globally flat, thus allowing their safety properties to be checked by efficient symbolic model checking tools using acceleration techniques, like FAST. In the second part, we extend IO nets in two natural ways: by lifting the restriction on the number of so-called "observed" places, and by lifting the restriction on so-called "destination" places. The first extension proves to be essentially equivalent to the IO model. The second extension however is much more expressive and is no longer globally flat, but we show that its parametrized reachability, coverability and liveness problems remain decidable in PSPACE. Additionally, we observe that the pre-image computation for this second extension is locally flat, which allows application of tools like FAST to the reachability problem. This second class captures in a simple way the core reason that the IO models allow verification in PSPACE, and we believe it is of independent theoretical interest.



page 1

page 2

page 3

page 4


Parameterized Analysis of Immediate Observation Petri Nets

We introduce immediate observation Petri nets, a class of interest in th...

Efficient Restrictions of Immediate Observation Petri Nets

In a previous paper we introduced immediate observation Petri nets, a su...

Verification of Flat FIFO Systems

The decidability and complexity of reachability problems and model-check...

Verification of Immediate Observation Population Protocols

Population protocols (Angluin et al., PODC, 2004) are a formal model of ...

The Emptiness Problem for Valence Automata over Graph Monoids

This work studies which storage mechanisms in automata permit decidabili...

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...

Verification of Nonblockingness in Bounded Petri Nets: A Novel Semi-Structural Approach

This paper proposes a semi-structural approach to verify the nonblocking...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.