A higher-order graph calculus for autonomic computing

DOI10.1007/978-3-642-02029-2_2MaRDI QIDQ3655135zbMATH OpenOpenAlexWikidataFDO

Authors Oana Andrei, Hélène Kirchner

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) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A port graph calculus for autonomic computing and invariant verification
• A higher-order calculus for graph transformation
• scientific article; zbMATH DE number 7340567
• A rewriting calculus for multigraphs with ports
• A calculus of concurrent graph-rewriting processes

Cites work

• A generalized higher-order chemical computation model
• A rewriting calculus for cyclic higher-order term graphs
• A rewriting semantics for Maude strategies
• A simple calculus for proteins and cells
• BioAmbients: an abstraction for biological compartments
• Brane Calculi
• Computational Methods in Systems Biology
• Computational Methods in Systems Biology
• scientific article; zbMATH DE number 1722718 (Why is no real title available?)
• MGS: a rule-based programming language for complex objects and collections
• Pure bigraphs: structure and dynamics
• Rewrite strategies in the rewriting calculus
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Strategic computation and deduction
• The rewriting calculus. II

Cited in

(9)

• A formal approach to the engineering of domain-specific distributed systems
• Labelled port graph -- a formal structure for models and computations
• Labelled graph strategic rewriting for social networks
• Runtime verification for biochemical programs
• Labelled graph rewriting meets social networks
• A higher-order calculus for graph transformation
• Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
• Strategic port graph rewriting: an interactive modelling framework
• A port graph calculus for autonomic computing and invariant verification

Describes a project that uses

Uses Software

• Stratego
• HOCL
• Tom
• MGS

This page was built for publication: A higher-order graph calculus for autonomic computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655135)