Parameterized Analysis of Immediate Observation Petri Nets

02/08/2019
by   Javier Esparza, et al.
0

We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. In these areas, relevant analysis questions translate into parameterized Petri net problems: whether an infinite set of Petri nets with the same underlying net, but different initial markings, satisfy a given property. We study the parameterized reachability, coverability, and liveness problems for immediate observation Petri nets. We show that all three problems are in PSPACE for infinite sets of initial markings defined by counting constraints, a class sufficiently rich for the intended application. This is remarkable, since the problems are already PSPACE-hard when the set of markings is a singleton, i.e., in the non-parameterized case. We use these results to prove that the correctness problem for immediate observation population protocols is PSPACE-complete, answering a question left open in a previous paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2020

On the Flatness of Immediate Observation Petri Nets

In a previous paper we introduced immediate observation (IO) Petri nets,...
research
07/17/2020

Efficient Restrictions of Immediate Observation Petri Nets

In a previous paper we introduced immediate observation Petri nets, a su...
research
01/30/2013

Dealing with Uncertainty on the Initial State of a Petri Net

This paper proposes a method to find the actual state of a complex dynam...
research
07/16/2018

Verification of Immediate Observation Population Protocols

Population protocols (Angluin et al., PODC, 2004) are a formal model of ...
research
01/25/2022

Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version)

Reconfigurable broadcast networks (RBN) are a model of distributed compu...
research
12/20/2017

Wadge Degrees of ω-Languages of Petri Nets

We prove that ω-languages of (non-deterministic) Petri nets and ω-langua...
research
03/18/2021

Computing Parameterized Invariants of Parameterized Petri Nets

A fundamental advantage of Petri net models is the possibility to automa...

Please sign up or login with your details

Forgot password? Click here to reset