An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Hierarchical graph transformation
Journal of Computer and System Sciences
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
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
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Shaped Generic Graph Transformation
Applications of Graph Transformations with Industrial Relevance
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Hierarchical Design Rewriting with Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
An algebra of hierarchical graphs
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
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
A formalisation of adaptable pervasive flows
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
An algebra of hierarchical graphs
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
On GS-monoidal theories for graphs with nesting
Graph transformations and model-driven engineering
Hierarchical models for service-oriented systems
Rigorous software engineering for service-oriented systems
Graph representation of sessions and pipelines for structured service programming
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Hi-index | 0.01 |
We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient way to describe configurations in languages with inherently hierarchical features such as sessions, fault-handling scopes or transactions. The graph syntax can be seen as an intermediate representation language, that facilitates the encoding of structured specifications and, in particular, of process calculi, since it provides primitives for nesting, name restriction and parallel composition. The syntax is based on an algebraic presentation that faithfully characterises families of hierarchical graphs, meaning that each term of the language uniquely identifies an equivalence class of graphs (modulo graph isomorphism). Proving soundness and completeness of an encoding (i.e. proving that structurally equivalent processes aremapped to isomorphic graphs) is then facilitated and can be done by structural induction. Summing up, the graph syntax facilitates the definition of faithful encodings, yet allowing a precise visual representation. We illustrate our work with an application to a work-flow language and a service-oriented calculus.