48 citations · 207 across the 23 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.FL2019
The Well Structured Problem for Presburger Counter Machines
Alain Finkel, Ekanshdeep Gupta
We introduce the well structured problem as the question of whether a model (here a counter machine) is well structured (here for the usual ordering on integers). We show that it i…
cs.CC2019★ 1 cited
Verification of Flat FIFO Systems
Alain Finkel, M. Praveen
The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lo…