Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Communications of the ACM
An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Hierarchical graph transformation
Journal of Computer and System Sciences
Normal forms for algebras of connections
Theoretical Computer Science
Definition of Programming Language Semantics Using Grammars for Hierarchical Graphs
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract hierarchical graph transformation
Mathematical Structures in Computer Science
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Sessions and Pipelines for Structured Service Programming
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Pure bigraphs: Structure and dynamics
Information and Computation
A graph syntax for processes and services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
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
Hierarchical models for service-oriented systems
Rigorous software engineering for service-oriented systems
| Hi-index | 0.00 |
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally or globally restricted nodes. Such graphs allow to represent explicitly and at the right level of abstraction some relevant topological and logical features of models and systems, including nesting, hierarchies, sharing of resources, and pointers or links. We also provide an encoding of the proposed algebra into terms of a gs-monoidal theory, and through these into a suitable class of "well-scoped" term graphs, showing that this encoding is sound and complete with respect to the axioms of the algebra.