A Port Graph Calculus for Autonomic Computing and Invariant Verification - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A Port Graph Calculus for Autonomic Computing and Invariant Verification

Oana Andrei
  • Fonction : Auteur
  • PersonId : 863370


In this paper, we first introduce port graphs as graphs with multiple edges and loops, with nodes having explicit connection points, called ports, and edges attaching to ports of nodes. We then define an abstract biochemical calculus that instantiates to a rewrite calculus on these graphs. Rules and strategies are themselves port graphs, i.e. first-class objects of the calculus. As a consequence, they can be rewritten as well, and rules can create new rules, providing a way of modeling adaptive systems. This approach also provides a formal framework to reason about computations and to verify useful properties. We show how structural properties of a modeled system can be expressed as strategies and checked for satisfiability at each step of the computation. This provides a way to ensure invariant properties of a system. This work is a contribution to the formal specification and verification of adaptive systems and to theoretical foundations ofautonomic computing.
Fichier principal
Vignette du fichier
verif.pdf (459.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00418560 , version 1 (20-09-2009)


  • HAL Id : inria-00418560 , version 1


Oana Andrei, Helene Kirchner. A Port Graph Calculus for Autonomic Computing and Invariant Verification. TERMGRAPH 2009, 5th International Workshop on Computing with Terms and Graphs, Satellite Event of ETAPS 2009, A. Corradini, Mar 2009, York, United Kingdom. ⟨inria-00418560⟩
991 Consultations
278 Téléchargements


Gmail Mastodon Facebook X LinkedIn More