Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-19T07:15:05.617Z Has data issue: false hasContentIssue false
  • English
  • Français

About the decision of reachability for register machines

Published online by Cambridge University Press:  15 February 2003

Véronique Cortier
Véronique Cortier*
Affiliation:
Laboratoire Spécification et Vérification, École Normale Supérieure de Cachan, CNRS, 61 avenue du Président Wilson, 94230 Cachan, France; [email protected].
Get access

Abstract

We study the decidability of the following problem: given p affine functions ƒ1,...,ƒp over $\mathbb{N}^k$ and two vectors $v_1, v_2\in\mathbb{N}^k$, is v2 reachable from v1 by successive iterations of ƒ1,...,ƒp (in this given order)? We show that this question is decidable for p = 1, 2 and undecidable for some fixed p.

Keywords

Verificationinfinite state systems.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 36 , Issue 4 , October 2002 , pp. 341 - 358
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

E. Asarin, G. Schneider and S. Yovine, Towards computing phase portraits of polygonal differential inclusions, in HSCC'2002, Hybrid Systems: Computation and Control. Stanford, USA, Lecture Notes in Comput. Sci. 2289 (2002) 49-61.
B. Boigelot, Symbolic Methods for Exploring Infinite Sate Spaces, Ph.D. Thesis. Université de Liège (1998) 225.
Comon, H. and Jurski, Y., Multiple counters automata, safety analysis and Presburger arithmetic, in Proc. Computer Aided Verification. Springer Verlag, Lecture Notes in Comput. Sci. 1427 (1998) 268-279. CrossRef
V. Cortier, Vérification de systèmes à compteurs (in French), Master's Thesis. Université Paris 7 (1999) http://www.lsv.ens-cachan.fr/cortier/memoire_dea.ps
Dickson, L.E., Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35 (1913) 413-422. CrossRef
Dufourd, C., Finkel, A. and Schnoebelen, Ph., Between decidability and undecidability, in Proc. ICALP 1998. Springer-Verlag, Lecture Notes in Comput. Sci. 1448 (1998) 103-115. CrossRef
A. Finkel, P. McKenzie and C. Picaronny, A well-structured framework for analysing Petri nets extensions. Technical Report, Research Report LSV-99-2 (1999) http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-1999-2.rr.ps
M.Yu. Matijacevitch, M. David and J. Robinson, Hilbert's Tenth Problem, Chapter 3 (1976).
C. Rorres and H. Anton, Applications of Linear Algebra, Chapters 9 and 13 (1979).