A model for distributed systems based on graph rewriting

Degano, Pierpaolo; Montanari, Ugo

doi:10.1145/23005.24038

Cited by 79 publications

(30 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…GDS [26,34], Grammars for Distributed Systems, combines distributed computation based on Hoare synchronisation with concurrent histories. 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

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

show abstract

“…Thus, in a last step (step (5) in Fig. 7) we apply a functor which forgets the transition and its adjacent arcs.…”

Section: Ad (2)mentioning

confidence: 99%

“…For instance, when modeling the firing of a Petri net transition, the elementary actions would be the removal of a token from a place in the transition's predomain and the addition of a token to a postdomain place. For the description of such rule schemes the concept of amalgamating rules at subrules is used which is based on synchronization mechanisms for rules developed first in [5].…”

Section: Introductionmentioning

confidence: 99%

Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation

Ermel

Taentzer

Bardohl³

2005

Formal Methods in Software and Systems Modeling

View full text Add to dashboard Cite

Abstract. The "classical" approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic HighLevel nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation. We show that the resulting amalgamated rules correspond to the behavior rules from the classical translation approach.

show abstract

“…Systems are modelled as graphs and computations correspond to graph-rewriting. Among other proposals, hypergraphs and synchronised hyperedge replacement (SHR, for short) have been proposed for modelling distributed systems [3,5] as a natural declarative framework.…”

Section: Introductionmentioning

confidence: 99%

SHReQ: coordinating application level QoS

Hirsch

Tuosto

2005

Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05)

View full text Add to dashboard Cite

We present SHReQ, a formal framework for specifying systems that handle abstract high-level QoS aspects which are becoming more and more important for service oriented computing. SHReQ combines Synchronised Hyperedge Replacement (SHR) with constraint-semirings. SHR is a (hyper)graph rewriting mechanism for modelling mobility and reconfiguration of systems. The novelty of the approach relies on the synchronisation mechanism which is based on constraint-semirings, algebraic structures that provide both the mathematics for multicriteria QoS and the synchronisation policies underlying the SHR mechanism.

show abstract

A model for distributed systems based on graph rewriting

Cited by 79 publications

References 17 publications

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

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

Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation

SHReQ: coordinating application level QoS

Contact Info

Product

Resources

About