An algebraic characterization of independence of Petri net processes

DOI10.1016/S0020-0190(03)00386-7zbMath1178.68369OpenAlexW2080364897MaRDI QIDQ1028983

Józef Winkowski

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00386-7

zbMATH Keywords

independencedistributed systemscategoryPetri netsconcatenationprocesses

Mathematics Subject Classification ID

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

Cites Work

• Sequential and concurrent behaviour in Petri net theory
• Behaviours of concurrent systems
• An algebraic description of system behaviours
• Branching processes of Petri nets
• Concurrent Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebraic characterization of independence of Petri net processes