Composing control flow and formula rules for computing on grids

2015/11/03 by Paolo Bottoni, Bottoni, Paolo, Nikolay Mirenkov +5
Computer Science · Decision Sciences · #Model-Driven Software Engineering Techniques #Scientific Computing and Data Management #Advanced Database Systems and Queries

paper · pdf · doi:10.14279/tuj.eceasst.10.161

Abstract

We define computation on grids as the composition, through pushout constructions, of control flows, carried across adjacency relations between grid cells, with formulas updating the value of some attribute. The approach is based on the identification of a subcategory of attributed typed graphs suitable to the definition of pushouts on grids, and is illustrated in the context of the Cyberfilm visual language.

Cited by

• Resource-based enactment and adaptation of workflows from activity diagrams

Related

• Structural Operational Semantics for Control Flow Graph Machines
• VEIL: Reading Control Flow Graphs Like Code
• DAG-width of Control Flow Graphs with Applications to Model Checking
• Compositional Separation of Control Flow and Data Flow
• Domain-Centered Support for Layout, Tasks, and Specification for Control Flow Graph Visualization