1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
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…