A Port Graph Calculus for Autonomic Computing and Invariant Verification

DOI10.1016/j.entcs.2009.10.015zbMath1291.68241OpenAlexW2087078274WikidataQ62041041 ScholiaQ62041041MaRDI QIDQ5170279

Hélène Kirchner, Oana Andrei

Publication date: 23 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.10.015

zbMATH Keywords

adaptive systemsbiochemical calculusrewriting strategiesautonomic computingrewriting calculusinvariant verificationport graphport graph rewriting

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (3)

Runtime verification for biochemical programs ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Twenty years of rewriting logic

Uses Software

• Stratego
• HOCL
• Tom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chemical abstract machine
• Formal molecular biology
• A Simple Calculus for Proteins and Cells
• On the Computational Power of Biochemistry
• A Higher-Order Graph Calculus for Autonomic Computing
• A Rewriting Semantics for Maude Strategies
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• A Rewriting Calculus for Multigraphs with Ports
• Computational Methods in Systems Biology

This page was built for publication: A Port Graph Calculus for Autonomic Computing and Invariant Verification