Compositional Reachability in Petri Nets

DOI10.1007/978-3-319-11439-2_18zbMath1448.68351OpenAlexW196379136MaRDI QIDQ3447710

Julian Rathke, Paweł Sobociński, Owen Stephens

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/397634/1/rp2014.pdf

Mathematics Subject Classification ID

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

Related Items (5)

Monoidal Width ⋮ Unnamed Item ⋮ Towards compositional graph theory ⋮ Open Petri nets ⋮ A Programming Language for Spatial Distribution of Net Systems

This page was built for publication: Compositional Reachability in Petri Nets