Synthesising CCS bisimulation using graph rewriting
Authors:
- 1 January 2009
- journal article
- Published by Elsevier in Information and Computation
- Vol. 207 (1) , 14-40
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contextsMathematical Structures in Computer Science, 2006
- Pure bigraphs: Structure and dynamicsInformation and Computation, 2006
- Behavioral theory for mobile ambientsJournal of the ACM, 2005
- Adhesive and quasiadhesive categoriesRAIRO - Theoretical Informatics and Applications, 2005
- From rewrite rules to bisimulation congruencesTheoretical Computer Science, 2002
- Mobile ambientsTheoretical Computer Science, 2000
- An Algebraic Presentation of Term Graphs, via GS-Monoidal CategoriesApplied Categorical Structures, 1999
- Multisets and structural congruence of the pi-calculus with replicationTheoretical Computer Science, 1999
- GRAPH PROCESSESFundamenta Informaticae, 1996
- The chemical abstract machineTheoretical Computer Science, 1992