On persistent reachability in Petri nets

DOI10.1016/j.ic.2012.11.004zbMath1293.68200OpenAlexW2010831447WikidataQ104379759 ScholiaQ104379759MaRDI QIDQ1951594

Łukasz Mikulski, Kamila Barylska, Edward Ochmański

Publication date: 6 June 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.11.004

zbMATH Keywords

reachabilityPetri netsdecidabilitypersistency

Mathematics Subject Classification ID

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

Related Items (2)

Step Persistence in the Design of GALS Systems ⋮ An extension of the taxonomy of persistent and nonviolent steps

This page was built for publication: On persistent reachability in Petri nets