S-invariant analysis of general recursive Petri boxes

zbMath0827.68080MaRDI QIDQ1894677

Raymond Devillers

Publication date: 24 July 1995

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Petri box calculusPetri boxes

Mathematics Subject Classification ID

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

Related Items (9)

Refinement of coloured petri nets ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ A refined view of the box algebra ⋮ General parameterised refinement and recursion for the M-net calculus ⋮ Nested-unit Petri nets ⋮ Petri boxes and finite precedence ⋮ Solving recursive net equations ⋮ Operational and denotational semantics for the box algebra ⋮ The box algebra = Petri nets + process expressions

This page was built for publication: S-invariant analysis of general recursive Petri boxes