Flatness and Complexity of Immediate Observation Petri Nets

DOI10.4230/LIPIcs.CONCUR.2020.45OpenAlexW3082894453MaRDI QIDQ5089312

Chana Weil-Kennedy, Javier Esparza, Mikhail Raskin

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2001.09966

zbMATH Keywords

Petri netsreachability analysisparameterized verificationflattability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Structural Liveness of Immediate Observation Petri Nets ⋮ Parameterized analysis of reconfigurable broadcast networks

Cites Work

• Unnamed Item
• Unnamed Item
• Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks
• Petri nets for modelling metabolic pathways: a survey
• EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system
• On the reachability problem for 5-dimensional vector addition systems
• On reachability equivalence for BPP-nets
• The computational power of population protocols
• A Petri net approach to the study of persistence in chemical reaction networks
• Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
• Automated Technology for Verification and Analysis

This page was built for publication: Flatness and Complexity of Immediate Observation Petri Nets