Compositional semantics for open Petri nets based on deterministic processes

DOI10.1017/S0960129504004311zbMath1089.68068OpenAlexW2131994575MaRDI QIDQ4657750

Reiko Heckel, Hartmut Ehrig, Paolo Baldan, Andrea Corradini

Publication date: 14 March 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129504004311

Mathematics Subject Classification ID

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

Related Items

Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Asynchronous Traces and Open Petri Nets ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets ⋮ Modeling dynamic reconfigurations in Reo using high-level replacement systems ⋮ A Normal Form for Stateful Connectors ⋮ Towards ``mouldable code via nested code graph transformation ⋮ Open Petri Nets: Non-deterministic Processes and Compositionality ⋮ Open Petri nets ⋮ Extensional Petri net ⋮ Concurrency cannot be observed, asynchronously ⋮ A Connector Algebra for P/T Nets Interactions ⋮ Modular Modelling of Software Product Lines with Feature Nets