Hierarchical models for service-oriented systems

Authors:
Roberto Bruni;Andrea Corradini;Fabio Gadducci;Alberto Lluch Lafuente;Ugo Montanari
Affiliations:
Department of Computer Science, University of Pisa, Italy;Department of Computer Science, University of Pisa, Italy;Department of Computer Science, University of Pisa, Italy;IMT Institute for Advanced Studies Lucca, Italy;Department of Computer Science, University of Pisa, Italy
Venue:
Rigorous software engineering for service-oriented systems
Year:
2011

Citing 13
Cited 0

Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
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
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

Handbook of graph grammars and computing by graph transformation
Tile formats for located and mobile systems

Information and Computation - Special issue on EXPRESS 1997
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
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
On GS-monoidal theories for graphs with nesting

Graph transformations and model-driven engineering
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects.