Structural Liveness of Immediate Observation Petri Nets

DOI10.3233/fi-222146arXiv2112.15524OpenAlexW4362701368MaRDI QIDQ6044494

Unnamed Author, Petr Jančar

Publication date: 19 May 2023

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

complexityPetri netsstructural livenessimmediate observation nets

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Existence of home states in Petri nets is decidable
• Complexity of some problems in Petri nets
• The computational power of population protocols
• Efficient restrictions of immediate observation Petri nets
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
• Computation in networks of passively mobile finite-state sensors
• Free Choice Petri Nets
• Flatness and Complexity of Immediate Observation Petri Nets

This page was built for publication: Structural Liveness of Immediate Observation Petri Nets