Solving recursive net equations

DOI10.1007/3-540-60084-1_109zbMath1412.68147OpenAlexW1753402276MaRDI QIDQ4645215

Eike Best, Maciej Koutny

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_109

zbMATH Keywords

Petri netsrecursiondenotational 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 (4)

A refined view of the box algebra ⋮ General parameterised refinement and recursion for the M-net calculus ⋮ Petri boxes and finite precedence ⋮ Operational and denotational semantics for the box algebra

Cites Work

• Structure of concurrency
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Operational and denotational semantics for the box algebra
• 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: Solving recursive net equations