How hard is it to verify flat affine counter systems with the finite monoid property?

DOI10.1007/978-3-319-46520-3_6zbMath1398.68311arXiv1605.05836OpenAlexW2400739323MaRDI QIDQ1990502

Radu Iosif, Arnaud Sangnier

Publication date: 25 October 2018

Full work available at URL: https://arxiv.org/abs/1605.05836

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Unnamed Item ⋮ Verification of Flat FIFO Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: How hard is it to verify flat affine counter systems with the finite monoid property?