A Higher-Order Graph Calculus for Autonomic Computing
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.
Domains
Symbolic Computation [cs.SC]
Origin : Files produced by the author(s)