Dense-choice Counter Machines revisited

Florent Bouchy
Alain Finkel
Pierluigi San Pietro

This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines, and we provide new undecidability and decidability results. Using the first-order additive mixed theory of reals and integers, we give a logical characterization of the sets of configurations reachable by reversal-bounded Dense-choice Counter Machines.

In Axel Legay: Proceedings International Workshop on Verification of Infinite-State Systems (INFINITY 2009), Bologna, Italy, 31th August 2009, Electronic Proceedings in Theoretical Computer Science 10, pp. 3–22.
Published: 17th November 2009.

ArXived at: http://dx.doi.org/10.4204/EPTCS.10.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org