Concurrency for Graph Grammars in a Petri net shell

DOI10.1016/S1571-0661(04)80192-0zbMath1263.68065OpenAlexW2084610712MaRDI QIDQ4923530

Paolo Baldan

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80192-0

zbMATH Keywords

domainsPetri netsgraph grammarsunfoldingevent structuresprocessesconcurrent semantics

Mathematics Subject Classification ID

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

Related Items (1)

GETGRATS

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
• Unnamed Item
• An axiomatization of the algebra of Petri net concatenable processes
• Process versus unfolding semantics for Place/Transition Petri nets
• Petri nets are monoids
• Petri nets, event structures and domains. I
• Partial order and contextual net semantics for atomic and locally atomic CC programs
• Contextual Petri nets, asymmetric event structures, and processes
• Axiomatizing the algebra of net computations and processes
• Contextual nets
• Semantics of inhibitor nets
• The non-sequential behaviour of Petri nets
• Parallelism and concurrency in high-level replacement systems
• On the semantics of place/transition Petri nets
• Efficiency of asynchronous systems and read arcs in petri nets
• An event structure semantics for graph grammars with parallel productions

This page was built for publication: Concurrency for Graph Grammars in a Petri net shell