8 citations · 22 across the 17 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 5 cited
Solving Parity Games on Integer Vectors
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier +1
We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity ga…
cs.LO2013
On the Complexity of Verifying Regular Properties on Flat Counter Systems
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Among the approximation methods for the verification of counter systems, one of them consists in model-checking their flat unfoldings. Unfortunately, the complexity characterizatio…