Synchronised Hyperedge Replacement as a Model for Service Oriented Computing

Ferrari, Gian Luigi; Hirsch, Dan; Lanese, Ivan; Montanari, Ugo; Tuosto, Emilio

doi:10.1007/11804192_2

Cited by 41 publications

(27 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The seamless combination of the two is actually possible, and easy. For instance, graph calculi based on (synchronized) hyper-edge replacement can conveniently represent a large variety of process algebras [13], while the cc-pi process description language [14] combines the mobility features of π-calculus with the generality of concurrent constraint programming based on nominal soft constraints. Here the key issue is that nodes of the graphs can be considered at the same time as names in the π-calculus sense (thus representing, channels, links, continuations, security keys) and as variables required to satisfy constraints involving functional and quality of service restrictions.…”

Section: Resultsmentioning

confidence: 99%

Constraint design rewriting

Bruni

Lafuente

Montanari

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks. The main idea is to consider classes of constraint networks as algebras whose operators are used to denote constraint networks with terms. Constraint network transformations such as constraint propagations are specified with rewrite rules exploiting the network's structure provided by terms.

show abstract

Section: Resultsmentioning

confidence: 99%

Constraint design rewriting

Bruni

Lafuente

Montanari

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…trees with unbounded number of components or interactions, square grids); 3) the impossibility of combining several styles in a homogeneous manner. To some extent, the latter two are addressed, respectively, by considering synchronised hyperedge replacement [13], context-sensitive grammars [12,33] and architecture views [29]. Our approach avoids these problems.…”

Section: Related Workmentioning

confidence: 99%

Configuration Logics: Modelling Architecture Styles

Mavridou

Baranov

Bliudze

et al. 2016

Formal Aspects of Component Software

View full text Add to dashboard Cite

We study a framework for the specification of architecture styles as families of architectures involving a common set of types of components and coordination mechanisms. The framework combines two logics: 1) interaction logics for the specification of architectures as generic coordination schemes involving a configuration of interactions between typed components; and 2) configuration logics for the specification of architecture styles as sets of interaction configurations. Configuration logics can be considered as a power-set extension of interaction logics. The relation between the two logics is similar to the relation between programs and their specifications. As program specifications can be expressed, eg. in temporal logics, architecture styles can be specified in configuration logics.The presented results build on previous work on architecture modelling in BIP. We show how propositional interaction logic can be extended into a corresponding configuration logic by adding new operators on sets of interaction configurations. In addition to the usual set-theoretic operators, configuration logic is equipped with a coalescing operator + to express combination of configuration sets. This operator proves to be particularly useful for the specification of architecture styles including a given class of configurations. We provide a complete axiomatization of propositional configuration logic as well as decision procedures for checking that an architecture satisfies given logical specifications.To allow genericity of specifications, we study first-order and second-order extensions of the propositional configuration logic. First-order logic formulas involve quantification over component variables. Second-order logic formulas involve additional quantification over sets of components. We provide several examples illustrating the application of the results to the characterisation of various architecture styles. We also provide an experimental evaluation using the Maude rewriting system to implement the decision procedure for the propositional flavour of the logic. We conclude with a discussion of the related work and of future directions dealing with the application of the results through the development of specific methods and tools.

show abstract

“…This model later evolved in Synchronized Hyperedge Replacement, SHR [45,46,40,36,48], where different synchronisation mechanisms are considered together with node merging and splitting.…”

Section: Ugo Montanari's Models Of Computationmentioning

confidence: 99%

Models of Computation: A Tribute to Ugo Montanari’s Vision

Bruni

Sassone

2008

Concurrency, Graphs and Models

View full text Add to dashboard Cite

Ugo's research activity in the area of Models of Computation (MoC, for short) has been prominent, influential and broadly scoped. Ugo's trademark is that undefinable ability to understand and distill computational aspects into new models as if you were reading them out of some evident connection between well-know models: only, most often, that connection is really visible only after Ugo shows the way. Like experienced sailors have trusted compasses and sextants to help them find the best routes to harbour, Ugo relies on a bag of favourite tools which he has used along the years to deliver a variety of contributions to the MoC area. To mention just three (in alphabetic order): algebraic techniques, concurrency theory, and unification mechanisms.In this introductory contribution we would like to recall some of the influential MoC models put forward by Ugo which cut across the three approaches. Before doing that, it is worth devoting some space to discuss the three aspects separately. Notably, the use of category theory is a pervasive common trait.Algebraic techniques. By algebraic techniques we refer broadly to the use of universal algebras and initial model semantics; of universal coalgebras and final semantics; and of bialgebras. Many interesting papers witness Ugo's leading role in exploiting algebraic techniques during his entire scientific career. Indeed, his contributions are too many to mention all in the space allocated to this overview; we shall therefore attempt to convey the sense of Ugo's broad-spectrum contribution by recapping only a few key results.Reference [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented several key insights in software specification and development for the first time, like the separation between given sorts and newly specified ones, whereby the given sorts lay the ground to define the observable behaviour for the new sorts. Another key suggestion is that the specification of new data types is often partial -in the sense that it may include "don't care" cases-and that many realisations can exist that exhibit equivalent observable behaviour but are not isomorphic. In fact, [43] shows that the isomorphism classes of observably equivalent algebras conforming to the partial specification form a complete lattice, yielding a so-called loose semantics.Possibly the best known of Ugo's papers, [52] exposes the underlying monoidal structure of the category of Petri net computations. The title itself is revealing: Petri nets are monoids. Besides doing what it says on the tin, this paper opened a long-lasting and fruitful collaboration with José Meseguer, and a research line on the initial semantics of P. Degano et al. (Eds.): Montanari

show abstract

Synchronised Hyperedge Replacement as a Model for Service Oriented Computing

Cited by 41 publications

References 20 publications

Constraint design rewriting

Constraint design rewriting

Configuration Logics: Modelling Architecture Styles

Models of Computation: A Tribute to Ugo Montanari’s Vision

Contact Info

Product

Resources

About