Labelled Port Graph – A Formal Structure for Models and Computations

Maribel Fernández (1) , Hélène Kirchner (2) , Bruno Pinaud (3, 4)

1 King‘s College London
2 Inria Siège
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique
4 UB - Université de Bordeaux

We present a general definition of labelled port graph that serves as a basis for the design of graph-based programming and modelling frameworks (syntax and semantics). We show that this structure provides the syntax for programs, which are composed of an initial graph, a set of rules and a strategy. Rules, represented as labelled port graphs, apply to states, also represented as labelled port graphs, and compute their successors according to the given strategy. The description of states, rules, and computations controlled by strategies, using labelled port graphs, is detailed and illustrated with examples from Porgy, a strategic port graph rewriting environment for the design of executable specifications of complex systems.

Mots clés: strategy; rewrite rule; labelled port graph; Porgy; rule-based modelling

Domaines: Algorithme et structure de données [cs.DS]; Théorie et langage formel [cs.FL]

Maribel Fernández, Hélène Kirchner, Bruno Pinaud. Labelled Port Graph – A Formal Structure for Models and Computations. The 12th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2017), Sep 2017, Brasília, Brazil. pp.3 - 21, ⟨10.1016/j.entcs.2018.10.002⟩. ⟨hal-01910220⟩