Selected papers of the Second Workshop on Concurrency and compositionality
An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Fundamenta Informaticae - Special issue on graph transformations
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Variations on mobile processes
Theoretical Computer Science
Modeling concurrent, mobile and coordinated systems via graph transformations
Handbook of graph grammars and computing by graph transformation
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Normal forms for algebras of connections
Theoretical Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Concurrent rewriting for graphs with equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Confluence of graph transformation revisited
Processes, Terms and Cycles
A framework for the verification of infinite-state graph transformation systems
Information and Computation
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Modelling and Verifying Mobile Systems Using π -Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On Symbolic Semantics for Name-decorated Contexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
BPM '09 Proceedings of the 7th International Conference on Business Process Management
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Service oriented architectural design
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
LTS semantics for process calculi from their graphical encodings
ICGT'10 Proceedings of the 5th international conference on Graph transformations
On GS-monoidal theories for graphs with nesting
Graph transformations and model-driven engineering
Adhesivity is not enough: local church-rosser revisited
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Checking bisimilarity for attributed graph transformation
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewriting mechanisms for modelling the reduction semantics of the calculus.