Iterating Octagons

@inproceedings{Bozga2009IteratingO,
  title={Iterating Octagons},
  author={Marius Bozga and Codruta G{\^i}rlea and Radu Iosif},
  booktitle={TACAS},
  year={2009}
}
In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct consequence of this fact is that the reachability problem is decidable for flat counter automata with octagonal transition relations. This result improves the previous results of Comon and… CONTINUE READING