Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

DOI10.1007/978-3-540-85762-4_17zbMath1161.68626OpenAlexW1867292771MaRDI QIDQ5505606

Masaki Murakami

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_17

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

Uses Software

• LMNtal

Cites Work

• Unnamed Item
• Asynchronous process calculi: The first- and higher-order paradigms
• A formal model of concurrent systems based on bipartite directed acyclic graph
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
• Programming Languages and Systems

This page was built for publication: Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs