2011
DOI: 10.1007/978-3-642-20401-2_16
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical Models for Service-Oriented Systems

Abstract: 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 defin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 15 publications
(23 reference statements)
0
2
0
Order By: Relevance
“…In fact, hierarchical graphs have also been formalized in category theory to model hierarchical structures [15] (where coupling of hyper-graphs and forests yields bigraphs) [2] (graphs inside graphs). Although hierarchical graphs encapsulate the hierarchy of nodes (here, boxes) and the communication links between nodes, the nature and structure of nodes and node containment (nesting) and links between nodes do not have the same meaning as described in Section 2.…”
Section: Other Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In fact, hierarchical graphs have also been formalized in category theory to model hierarchical structures [15] (where coupling of hyper-graphs and forests yields bigraphs) [2] (graphs inside graphs). Although hierarchical graphs encapsulate the hierarchy of nodes (here, boxes) and the communication links between nodes, the nature and structure of nodes and node containment (nesting) and links between nodes do not have the same meaning as described in Section 2.…”
Section: Other Workmentioning
confidence: 99%
“…The source and target of a link are ports at the same level of hierarchy of a box. We do not use two separate structures to define boxes (objects) and as a basis for composite boxes (arrows), and in this our approach contrasts with the two-structure approaches of [15] (place graph and linking graph ) and [2] (graph layer and hierarchical graph).…”
Section: Other Workmentioning
confidence: 99%