How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?

Radu Iosif (1) , Arnaud Sangnier (2)

1 VERIMAG - IMAG - VERIMAG
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved by imposing two restrictions: (1) the control structure of the counter system is flat, meaning that nested loops are forbidden, and (2) the multiplicative monoid generated by the affine update matrices present in the system is finite. We provide complexity bounds for several decision problems of such systems, by proving that reachability and model checking for Past Linear Temporal Logic stands in the second level of the polynomial hierarchy Σ P 2 , while model checking for First Order Logic is PSPACE-complete.

Domaines: Théorie et langage formel [cs.FL]

Radu Iosif, Arnaud Sangnier. How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?. 14th International Symposium on Automated Technology for Verification and Analysis, Oct 2016, Chiba, Japan. pp.89-105, ⟨10.1007/978-3-319-46520-3_6⟩. ⟨hal-01418881⟩