The box algebra = Petri nets + process expressions

DOI10.1016/S0890-5401(02)93117-2zbMath1012.68117MaRDI QIDQ1854558

Maciej Koutny, Raymond Devillers, Eike Best

Publication date: 14 January 2003

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

Mathematics Subject Classification ID

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

Related Items

Nested-unit Petri nets, A Chart Semantics for the Pi-Calculus, Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets, Transformations in Reconfigurable Place/Transition Systems, Calculi of net structures and sets are similar

Cites Work

• On the implementation of concurrent calculi in net calculi: two case studies
• Failures semantics based on interval semiwords is a congruence for refinement
• A distributed operational semantics of CCS based on condition/event systems
• Sequential and concurrent behaviour in Petri net theory
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Analysis of Petri nets by stepwise refinements
• Operational and denotational semantics for the box algebra
• Flow models of distributed computations: Three equivalent semantics for CCS
• S-invariant analysis of general recursive Petri boxes
• Nets, Terms and Formulas
• Process Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item