Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants

DOI10.4230/DROPS.MEMICS.2009.2346zbMath1247.68186OpenAlexW2141017018MaRDI QIDQ2917313

Mikael H. Møller, Lasse Jacobsen, Morten Jacobsen

Publication date: 28 September 2012

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2346/pdf/09006.JacobsenLasse.2346.pdf

zbMATH Keywords

undecidabilityboundednesscoverabilitytimed-arc Petri nets

Mathematics Subject Classification ID

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

Related Items (1)

Verification of Timed-Arc Petri Nets

This page was built for publication: Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants