8 citations · 22 across the 17 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
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.FL2016
The Complexity of Flat Freeze LTL
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
We consider the model-checking problem for freeze LTL on one-counter automata (OCA). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter…