A Higher-Order Graph Calculus for Autonomic Computing

Andrei, Oana; Kirchner, Hélène

doi:10.1007/978-3-642-02029-2_2

Cited by 27 publications

(23 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we consider port graphs with attributes associated with nodes, ports and edges, generalising the notion of port graph introduced in [2,3]. The following definitions, based on [19], have been generalised to use indistinctly either directed or undirected edges.…”

Section: Labelled Graph Rewritingmentioning

confidence: 99%

Labelled Graph Rewriting Meets Social Networks

Fernández

Kirchner

Pinaud

et al. 2016

Rewriting Logic and Its Applications

Self Cite

View full text Add to dashboard Cite

Abstract. The intense development of computing techniques and the increasing volumes of produced data raise many modelling and analysis challenges. There is a need to represent and analyse information that is: complex -due to the presence of massive and highly heterogeneous data-, dynamic -due to interactions, time, external and internal evolutions-, connected and distributed in networks. We argue in this work that relevant concepts to address these challenges are provided by three ingredients: labelled graphs to represent networks of data or objects; rewrite rules to deal with concurrent local transformations; strategies to express control versus autonomy and to focus on points of interests. To illustrate the use of these concepts, we choose to focus our interest on social networks analysis, and more precisely in this paper on random network generation. Labelled graph strategic rewriting provides a formalism in which different models can be generated and compared. Conversely, the study of social networks, with their size and complexity, stimulates the search for structure and efficiency in graph rewriting. It also motivated the design of new or more general kinds of graphs, rules and strategies (for instance, to define positions in graphs), which are illustrated here. This opens the way to further theoretical and practical questions for the rewriting community.

show abstract

Section: Labelled Graph Rewritingmentioning

confidence: 99%

Labelled Graph Rewriting Meets Social Networks

Fernández

Kirchner

Pinaud

et al. 2016

Rewriting Logic and Its Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Finally, in the area of concurrency theory, calculi such as those defined in [Banâtre et al 2004] and in [Andrei and Kirchner 2009], relying on the (bio)chemical programming paradigm, have been proposed for the specification of autonomic systems. Some other formalisms, like e.g.…”

Section: Related Workmentioning

confidence: 99%

A Formal Approach to Autonomic Systems Programming: The SCEL Language

Nicola

2015

Formal Aspects of Component Software

View full text Add to dashboard Cite

The autonomic computing paradigm has been proposed to cope with size, complexity and dynamism of contemporary software-intensive systems. The challenge for language designers is to devise appropriate abstractions and linguistic primitives to deal with the large dimension of systems, and with their need to adapt to the changes of the working environment and to the evolving requirements. We propose a set of programming abstractions that permit to represent behaviors, knowledge and aggregations according to specific policies, and to support programming context-awareness, self-awareness and adaptation. Based on these abstractions, we define SCEL (Software Component Ensemble Language), a kernel language whose solid semantic foundations lay also the basis for formal reasoning on autonomic systems behavior. To show expressiveness and effectiveness of SCEL's design, we present a Java implementation of the proposed abstractions and show how it can be exploited for programming a robotics scenario that is used as a running example for describing features and potentials of our approach.

show abstract

“…In this paper we consider port graph rewriting systems [1,3,4], of which interaction nets [27] are a particular case.…”

Section: Background: Port Graph Rewritingmentioning

confidence: 99%

A Strategy Language for Graph Rewriting

Fernández¹,

Kirchner²,

Namet³

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We give a formal semantics for a graph-based programming language, where a program consists of a collection of graph rewriting rules, a user-defined strategy to control the application of rules, and an initial graph to be rewritten. The traditional operators found in strategy languages for term rewriting have been adapted to deal with the more general setting of graph rewriting, and some new constructs have been included in the language to deal with graph traversal and management of rewriting positions in the graph. This language is part of the graph transformation and visualisation environment PORGY.

show abstract

A Higher-Order Graph Calculus for Autonomic Computing

Abstract: Abstract. In this paper, we present a high-level formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems.

Cited by 27 publications

References 22 publications

Labelled Graph Rewriting Meets Social Networks

Labelled Graph Rewriting Meets Social Networks

A Formal Approach to Autonomic Systems Programming: The SCEL Language

A Strategy Language for Graph Rewriting

Contact Info

Product

Resources

About