Checking Bisimilarity for Attributed Graph Transformation
Open Access
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 113-128
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Deriving Bisimulation Congruences for Conditional Reactive Systems2012
- ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local ConfluenceFundamenta Informaticae, 2012
- Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)Electronic Notes in Theoretical Computer Science, 2009
- Synthesising CCS bisimulation using graph rewritingInformation and Computation, 2009
- Graph rewriting for the π-calculusMathematical Structures in Computer Science, 2007
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contextsMathematical Structures in Computer Science, 2006
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1The Journal of Logic Programming, 1998
- Symbolic bisimulationsTheoretical Computer Science, 1995
- Bisimulation equivalence is decidable for basic parallel processes1993
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985