Petri boxes and finite precedence

DOI10.1007/3-540-61604-7_70MaRDI QIDQ6162099zbMATH OpenOpenAlexFDO

Authors Raymond Devillers

Publication date 28 June 2023

Published in CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61604-7_70

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 512822
• S-invariant analysis of general recursive Petri boxes
• scientific article; zbMATH DE number 785044
• Compositional process semantics of Petri Boxes
• An Axiomatisation of Duplication Equivalence in the Petri Box Calculus

Cites work

• A class of composable high level Petri nets
• scientific article; zbMATH DE number 512822 (Why is no real title available?)
• Rational and recognizable complex trace languages
• S-invariant analysis of general recursive Petri boxes
• Sequential and concurrent behaviour in Petri net theory
• Solving recursive net equations

Cited in

(1)

• scientific article; zbMATH DE number 512822 (Why is no real title available?)

This page was built for publication: Petri boxes and finite precedence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162099)