Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra

DOI10.1016/S1571-0661(04)80950-2zbMath1263.68107MaRDI QIDQ4923515

Robert Lorenz, Gabriel Juhás, Jörg Desel

Publication date: 24 May 2013

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Petri nets are monoids
• Sequential and concurrent behaviour in Petri net theory
• Behaviours of concurrent systems
• An algebraic description of system behaviours
• Axiomatizing the algebra of net computations and processes
• Contextual nets
• Semantics of inhibitor nets
• An axiomatization of the category of Petri net computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra