On relating rewriting systems and graph grammars to event structures

DOI10.1007/3-540-57787-4_21zbMath1494.68122OpenAlexW1936320922MaRDI QIDQ5096291

Georg Schied

Publication date: 16 August 2022

Published in: Graph Transformations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57787-4_21

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 (7)

Concurrent graph and term graph rewriting ⋮ A graph rewriting framework for Statecharts semantics ⋮ An event structure semantics for graph grammars with parallel productions ⋮ A calculus of concurrent graph-rewriting processes ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ Minimisation of event structures ⋮ Relating conflict-free stable transition and event models via redex families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graph rewritings
• Concurrent transition systems
• Petri nets, event structures and domains. I
• Conditional rewriting logic as a unified model of concurrency
• Graph expressions and graph rewritings
• Actor grammars
• Connections between a concrete and an abstract model of concurrent systems

This page was built for publication: On relating rewriting systems and graph grammars to event structures