8 citations · 12 across the 11 of their papers we have counts for
11 papers · 1 filter
Robust Algebraic Theories of Triangle Graphs
Marius Bozga, Radu Iosif, Florian Zuleger
Triangle graphs are graphs of tree-width at most three in which every edge belongs to a triangle. This class encompasses well-known graph families such as Apollonian networks. We a…
Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
Marius Bozga, Radu Iosif, Florian Zuleger
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable…
Iterating Non-Aggregative Structure Compositions
Marius Bozga, Radu Iosif, Florian Zuleger
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory…
Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
Radu Iosif, Arnaud Sangnier, Neven Villani
We consider the parametric reachability problem (PRP) for families of networks described by vertex-replacement (VR) graph grammars, where network nodes run replicas of finite-state…
Counting Abstraction for the Verification of Structured Parameterized Networks
Marius Bozga, Radu Iosif, Arnaud Sangnier +1
We consider the verification of parameterized networks of replicated processes whose architecture is described by hyperedge-replacement graph grammars. Due to the undecidability of…
Regular Grammars for Sets of Graphs of Tree-Width 2
Marius Bozga, Radu Iosif, Florian Zuleger
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classe…