• Corpus ID: 210920662

On the Flatness of Immediate Observation Petri Nets

@article{Raskin2020OnTF,
  title={On the Flatness of Immediate Observation Petri Nets},
  author={Mikhail Raskin and Chana Weil-Kennedy},
  journal={ArXiv},
  year={2020},
  volume={abs/2001.09966}
}
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… 

Figures from this paper

References

SHOWING 1-10 OF 16 REFERENCES
Parameterized Analysis of Immediate Observation Petri Nets
TLDR
The results are used to prove that the correctness problem for immediate observation population protocols is \(\mathsf {PSPACE}\)-complete, answering a question left open in a previous paper.
Verification of Immediate Observation Population Protocols
TLDR
This paper restricts attention to immediate observation (IO) population protocols, a class introduced and studied in (Angluin et al., PODC, 2006), and shows that both problems are solvable in exponential space for IO protocols.
The complexity of verifying population protocols
TLDR
The computational complexity of the correctness problem for all other classes introduced by Angluin et al., some of which are less powerful than the main model, are studied.
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
TLDR
It is shown that the set of possible counter values which can be reached after any number of iterations of a loop is definable in the additive theory of ℕ (or ℤ or ℝ depending on the type of the counters).
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
TLDR
It is proved that for finite linear systems, the accelerations of sequences of transitions always produce an effective Presburger-definable relation, and it is shown how to choose the good sequences of length n whose number is polynomial in n although the total number of Sequence n is exponential in n.
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
The paper provides a structural characterisation of the reachable markings of Petri nets in which every transition has exactly one input place. As a corollary, the reachability problem for this class
On Functions Weakly Computable by Petri Nets and Vector Addition Systems
We show that any unbounded function weakly computable by a Petri net or a VASS cannot be sublinear. This answers a long-standing folklore conjecture about weakly computing the inverses of some
The computational power of population protocols
TLDR
It is proved that all predicates stably computable in this model of population protocols (and certain generalizations of it) are semilinear, answering a central open question about the power of the model.
TReX: A Tool for Reachability Analysis of Complex Systems
TLDR
Finite-state model-checkers such as Smv and Spin do not allow to deal with important aspects that appear in modelling and analysing complex systems, e.g., real-time constraints, manipulation of unbounded data structures like counters, communication through unbounded channels, parametric reasoning, etc.
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
The authors prove the decidability of two subclasses of recursive processes involving a parallel composition operator with respect to bisimulation equivalence, namely, the so-called normed and live
...
...