A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence
Information and Computation
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Proof, language, and interaction
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Normal Forms for Partitions and Relations
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Synchronized Hyperedge Replacement with Name Mobility
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Reconfiguration of Software Architecture Styles with Name Mobility
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Hyperedge Replacement with Rendevous
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Coinductive Techniques for Operational Equivalence of Interaction Nets
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Tile Bisimilarity Congruences for Open Terms and Term Graphs
Tile Bisimilarity Congruences for Open Terms and Term Graphs
Dynamic connectors for concurrency
Theoretical Computer Science
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
Theory and Practice of Logic Programming
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 0.00 |
We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks.We use the framework of synchronized graph rewriting with mobility which we describe in two different, but operationally equivalent ways: on graphs defined as syntactic judgements and by using tile logic. One of the main results of the paper says that bisimilarity for synchronized graph rewriting is a congruence whenever the rewriting rules satisfy the basic source property. Furthermore we introduce an up-to technique simplifying bisimilarity proofs and use it in an example to show the equivalence of a communication network and its specification.