Selected papers of the Second Workshop on Concurrency and compositionality
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
Fundamenta Informaticae - Special issue on graph transformations
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science
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
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
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
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Pure bigraphs: structure and dynamics
Information and Computation
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2000
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph processes with fusions: concurrency by colimits, again
Formal Methods in Software and Systems Modeling
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Borrowed contexts for attributed graphs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
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 |
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 proposed by Ehrig and Konig and based on borrowed contexts (bcs), 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 major technical contributions towards the simplification of the bc mechanism, a key result of our work is the proof that the bisimilarity on processes obtained via bcs coincides with the standard strong bisimilarity for ccs.