Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Selected papers of the Second Workshop on Concurrency and compositionality
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science
Handbook of graph grammars and computing by graph transformation
From rewrite rules to bisimulation congruences
Theoretical Computer Science
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Graph processes with fusions: concurrency by colimits, again
Formal Methods in Software and Systems Modeling
Adhesive DPO Parallelism for Monic Matches
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Modelling and Verifying Mobile Systems Using π -Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
RPO, second-order contexts, and λ-calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Efficient bisimilarities from second-order reaction semantics for π-calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Hi-index | 0.00 |
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is mapped into a (ranked) graph, such that the denotation is fully abstract with respect to the usual structural congruence (i.e., two processes are equivalent exactly when the corresponding encodings yield the same graph). Ranked graphs are naturally equipped with a few algebraic operations, and they are proved to form a suitable (bi)category of cospans. Then, as proved by Sassone and Sobocinski, the synthesis mechanism based on relative pushout, originally proposed by Milner and Leifer, can be applied. The resulting labelled transition system has ranked graphs as both states and labels, and it induces on (encodings of) processes an observational equivalence that is reminiscent of early bisimilarity.