Extensional Petri net

DOI10.1007/s00165-018-0473-3zbMath1425.68292OpenAlexW2900739587MaRDI QIDQ667521

Yuxi Fu, Daniele Varacca, Xiaoju Dong

Publication date: 13 March 2019

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-018-0473-3

zbMATH Keywords

compositionalitybisimulationPetri net

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of interaction
• Petri nets are monoids
• On the expressiveness of interaction
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• A distributed operational semantics of CCS based on condition/event systems
• A structure to decide reachability in Petri nets
• A calculus of mobile processes. II
• The covering and boundedness problems for vector addition systems
• Operational and denotational semantics for the box algebra
• A uniform approach to true-concurrency and interleaving semantics for Petri nets
• Parallel program schemata
• The Value-Passing Calculus
• Encoding Asynchronous Interactions Using Open Petri Nets
• Open Petri Nets: Non-deterministic Processes and Compositionality
• Communicating sequential processes
• Branching time and abstraction in bisimulation semantics
• Demystifying Reachability in Vector Addition Systems
• Compositional semantics for open Petri nets based on deterministic processes
• Barbed bisimulation
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Non-deterministic structures of computation
• Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets

This page was built for publication: Extensional Petri net