Solving recursive net equations
From MaRDI portal
Recommendations
Cites work
- Coloured Petri nets. Basic concepts, analysis methods and practical use. Vol. 1
- Finite representations of CCS and TCSP programs by automata and Petri nets
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 512822 (Why is no real title available?)
- Nets, Terms and Formulas
- Nonsequential processes. A Petri net view
- Operational and denotational semantics for the box algebra
- Petri nets. An introduction. Transl. from the German
- Process Algebra
- S-invariant analysis of general recursive Petri boxes
- Specification and analysis of concurrent systems. The COSY approach
- Structure of concurrency
Cited in
(8)- Operational and denotational semantics for the box algebra
- General parameterised refinement and recursion for the M-net calculus
- On the greatest solution of equations in \(\mathrm{CLL}_R\)
- scientific article; zbMATH DE number 4047616 (Why is no real title available?)
- A refined view of the box algebra
- Petri boxes and finite precedence
- An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
- A reduced maximality labeled transition system generation for recursive Petri nets
This page was built for publication: Solving recursive net equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645215)