3 papers
cs.FL2025
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…
cs.FL2025
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…
cs.DC2022
Mending Partial Solutions with Few Changes
Darya Melnyk, Jukka Suomela, Neven Villani
In this paper, we study the notion of mending, i.e. given a partial solution to a graph problem, we investigate how much effort is needed to turn it into a proper solution. For exa…