Graph rewriting for the π-calculus
From MaRDI portal
Publication:5308095
DOI10.1017/S096012950700610XzbMath1125.68063MaRDI QIDQ5308095
Publication date: 26 September 2007
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (14)
String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ A Term-Graph Syntax for Algebras over Multisets ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Discretionary Information Flow Control for Interaction-Oriented Specifications ⋮ A decentralised graphical implementation of mobile ambients ⋮ Confluence of Graph Rewriting with Interfaces ⋮ A Decentralized Implementation of Mobile Ambients ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ On Symbolic Semantics for Name-decorated Contexts ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ Modelling and Verifying Mobile Systems Using π-Graphs ⋮ On GS-Monoidal Theories for Graphs with Nesting ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
This page was built for publication: Graph rewriting for the π-calculus
