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)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42: Grammars and rewriting systems
Related Items
On Symbolic Semantics for Name-decorated Contexts, A Note on an Old-Fashioned Algebra for (Disconnected) Graphs, A decentralised graphical implementation of mobile ambients, A framework for the verification of infinite-state graph transformation systems, Discretionary Information Flow Control for Interaction-Oriented Specifications, On GS-Monoidal Theories for Graphs with Nesting, Encoding Asynchronous Interactions Using Open Petri Nets, A Term-Graph Syntax for Algebras over Multisets, A Decentralized Implementation of Mobile Ambients, Modelling and Verifying Mobile Systems Using π-Graphs