Operational and denotational semantics for the box algebra

DOI10.1016/S0304-3975(97)00180-1zbMath0912.68126OpenAlexW2036836043MaRDI QIDQ1274445

Maciej Koutny, Eike Best

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00180-1

zbMATH Keywords

operational semanticsprocess algebraPetri netsrecursionbisimulationrefinementdenotational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Operational semantics for Petri net components ⋮ Verification of bounded Petri nets using integer programming ⋮ Relational structures model of concurrency ⋮ Extensional Petri net ⋮ Solving recursive net equations ⋮ The box algebra = Petri nets + process expressions

Cites Work

• Structure of concurrency
• Sequential and concurrent behaviour in Petri net theory
• Finite representations of CCS and TCSP programs by automata and Petri nets
• A structural approach to operational semantics
• S-invariant analysis of general recursive Petri boxes
• Process Algebra
• Solving recursive net equations
• A refined view of the box algebra
• Unnamed Item
• 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: Operational and denotational semantics for the box algebra