Pages that link to "Item:Q5308095"
From MaRDI portal
The following pages link to Graph rewriting for the π-calculus (Q5308095):
Displaying 19 items.
- A decentralised graphical implementation of mobile ambients (Q624388) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Name-passing style GUI programming in the {\(\pi\)}-calculus-based language Nepi (Q2851082) (← links)
- A chart semantics for the pi-calculus (Q2864369) (← links)
- Modelling calculi with name mobility using graphs with equivalences (Q2867900) (← links)
- Discretionary Information Flow Control for Interaction-Oriented Specifications (Q2945719) (← links)
- Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
- On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
- A Term-Graph Syntax for Algebras over Multisets (Q3184730) (← links)
- A Decentralized Implementation of Mobile Ambients (Q3540392) (← links)
- Modelling and Verifying Mobile Systems Using π-Graphs (Q3599092) (← links)
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure (Q5058366) (← links)
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
- On Symbolic Semantics for Name-decorated Contexts (Q5166612) (← links)
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs (Q5170278) (← links)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- Programming Languages and Systems (Q5902355) (← links)
