On the coverability and reachability languages of monotonic extensions of Petri nets

DOI10.1016/j.tcs.2012.09.021zbMath1277.68178OpenAlexW2073918004WikidataQ57831197 ScholiaQ57831197MaRDI QIDQ1935777

Fernando Rosa-Velardo, Giorgio Delzanno

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.021

zbMATH Keywords

Petri netsexpressive powerlanguage theorywell structured transition systems

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets

This page was built for publication: On the coverability and reachability languages of monotonic extensions of Petri nets