The box algebra = Petri nets + process expressions
From MaRDI portal
Publication:1854558
DOI10.1016/S0890-5401(02)93117-2zbMath1012.68117OpenAlexW1996887001MaRDI QIDQ1854558
Maciej Koutny, Raymond Devillers, Eike Best
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(02)93117-2
Related Items (7)
Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ Nested-unit Petri nets ⋮ Transformations in Reconfigurable Place/Transition Systems ⋮ Articulation of Transition Systems and Its Application to Petri Net Synthesis ⋮ Calculi of net structures and sets are similar ⋮ A Chart Semantics for the Pi-Calculus ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
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
This page was built for publication: The box algebra = Petri nets + process expressions