A Higher-Order Graph Calculus for Autonomic Computing

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.

[1]  Pascal Fradet,et al.  Chemical Specification of Autonomic Systems , 2004, IASSE.

[2]  Pascal Fradet,et al.  Programming Self-Organizing Systems with the Higher-Order Chemical Language , 2007, Int. J. Unconv. Comput..

[3]  Hélène Kirchner,et al.  Graph Rewriting and Strategies for Modeling Biochemical Networks , 2007, Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007).

[4]  François Fages,et al.  The Biochemical Abstract Machine BIOCHAM , 2004, CMSB.

[5]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[6]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[7]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[8]  Luca Cardelli,et al.  Brane Calculi , 2004, CMSB.

[9]  Pascal Fradet,et al.  A Generalized Higher-Order Chemical Computation Model , 2006, Electron. Notes Theor. Comput. Sci..

[10]  Cosimo Laneve,et al.  A Simple Calculus for Proteins and Cells , 2007, Electron. Notes Theor. Comput. Sci..

[11]  Oana Andrei,et al.  A Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems. (Un calcul de réécriture de graphes : applications à la biologie et aux systèmes autonomes) , 2008 .

[12]  Luca Cardelli,et al.  BioAmbients: an abstraction for biological compartments , 2004, Theor. Comput. Sci..

[13]  Mario Lauria,et al.  Application-specific scheduling for the organic grid , 2004, 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935).

[14]  Claude Kirchner,et al.  Rewrite strategies in the rewriting calculus , 2003, WRS.

[15]  Eelco Visser,et al.  Stratego: A Language for Program Transformation Based on Rewriting Strategies , 2001, RTA.

[16]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[17]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..

[18]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[19]  Jeffrey O. Kephart,et al.  The Vision of Autonomic Computing , 2003, Computer.

[20]  Ian Stark,et al.  The Continuous pi-Calculus: A Process Algebra for Biochemical Modelling , 2008, CMSB.

[21]  José Meseguer,et al.  A Rewriting Semantics for Maude Strategies , 2009, WRLA.

[22]  Claude Kirchner,et al.  The rewriting calculus - Part I , 2001, Log. J. IGPL.

[23]  Claude Kirchner,et al.  Strategic Computation and Deduction , 2008 .

[24]  Claude Kirchner,et al.  Rewriting with Strategies in ELAN: A Functional Semantics , 2001, Int. J. Found. Comput. Sci..

[25]  Clara Bertolissi,et al.  A Rewriting Calculus for Cyclic Higher-order Term Graphs , 2005, Electron. Notes Theor. Comput. Sci..

[26]  Daniel Le Métayer,et al.  A new computational model and its discipline of programming , 1986 .

[27]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[28]  Claude Kirchner,et al.  The rewriting calculus - Part II , 2001, Log. J. IGPL.

[29]  Hélène Kirchner,et al.  A Rewriting Calculus for Multigraphs with Ports , 2007, RULE@RDP.

[30]  Jean-Louis Giavitto,et al.  MGS: a Rule-Based Programming Language for Complex Objects and Collections , 2001, Electron. Notes Theor. Comput. Sci..

[31]  Vincent Danos,et al.  Projective Brane Calculus , 2004, CMSB.

[32]  Pierre-Etienne Moreau,et al.  Tom: Piggybacking Rewriting on Java , 2007, RTA.