A Higher-Order Graph Calculus for Autonomic Computing

DOI10.1007/978-3-642-02029-2_2zbMath1194.68117OpenAlexW1547366936WikidataQ62041043 ScholiaQ62041043MaRDI QIDQ3655135

Hélène Kirchner, Oana Andrei

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_2

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (7)

Runtime verification for biochemical programs ⋮ Labelled graph strategic rewriting for social networks ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ A Port Graph Calculus for Autonomic Computing and Invariant Verification ⋮ A formal approach to the engineering of domain-specific distributed systems ⋮ Labelled Graph Rewriting Meets Social Networks ⋮ Labelled port graph -- a formal structure for models and computations

Uses Software

• Stratego
• HOCL
• Tom
• MGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• BioAmbients: an abstraction for biological compartments
• Pure bigraphs: structure and dynamics
• The rewriting calculus - part II
• MGS
• A Simple Calculus for Proteins and Cells
• A Rewriting Semantics for Maude Strategies
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Computational Methods in Systems Biology
• Computational Methods in Systems Biology
• Brane Calculi

This page was built for publication: A Higher-Order Graph Calculus for Autonomic Computing