Selected papers of the Second Workshop on Concurrency and compositionality
Fundamenta Informaticae - Special issue on graph transformations
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Communication and Concurrency
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Pure bigraphs: Structure and dynamics
Information and Computation
Processes for adhesive rewriting systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Abstract Semantics by Observable Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Synthesising CCS bisimulation using graph rewriting
Information and Computation
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
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
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
LTS semantics for process calculi from their graphical encodings
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Hi-index | 0.00 |
The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner's Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interfaces, such that the denotation is fully abstract with respect to the usual structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (bcs), proposed by Ehrig and König (which are an instance of relative pushouts, originally introduced by Milner and Leifer). The bc mechanism allows the effective construction of an lts that has graphs with interfaces as both states and labels, and such that the associated bisimilarity is automatically a congruence. Our paper focuses on the analysis of the lts distilled by exploiting the encoding of ccs processes: besides offering some technical contributions towards the simplification of the bc mechanism, the key result of our work is the proof that the bisimilarity on processes obtained via bcs coincides with the standard strong bisimilarity for ccs.