Labelled Port Graph – A Formal Structure for Models and Computations

Abstract : 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.
Liste complète des métadonnées
Contributor : Bruno Pinaud <>
Submitted on : Wednesday, October 31, 2018 - 4:40:42 PM
Last modification on : Friday, April 12, 2019 - 10:20:07 AM
Document(s) archivé(s) le : Friday, February 1, 2019 - 4:55:47 PM


Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License




Maribel Fernández, Hélène Kirchner, Bruno Pinaud. Labelled Port Graph – A Formal Structure for Models and Computations. Electronic Notes in Theoretical Computer Science, Elsevier, 2018, The 12th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2017), 338, pp.3 - 21. ⟨10.1016/j.entcs.2018.10.002⟩. ⟨hal-01910220⟩



Record views


Files downloads