Abstract
We study a formal model of imperative sequential programs and focus on the equivalence problem for some class of programs with mode switching whose runs can be divided into two stages. In the first stage a program selects an appropriate mode of computation. Several modes may be tried (switched) in turn before making the ultimate choice. Every time when the next mode is put to a test, the program brings data to some predefined state. In the second stage of the run, once a definite mode is fixed, the final result of computation is produced. We develop a new technique for simulating the behavior of such programs by means of finite automata and demonstrate that the equivalence problem for programs with mode switching is decidable within a polynomial space. By revealing a close relationships between the equivalence problem for this class of programs and the intersection emptiness problem for deterministic finite automata we show that the the former is PSPACE-complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Letichevsky, A.A.: Functional equivalence of discrete transducers. Cybernetics, 14–28 (1970)
Lisovik, L.P.: Hard sets and semilinear reservoir method with applications. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 219–231. Springer, Heidelberg (1996)
Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundation of Computer Science (FOCS), pp. 254–266. IEEE, Los Alamitos (1977)
Podlovchenko, R.I., Zakharov, V.A.: On the polynomial-time algorithm deciding the commutative equivalence of program schemes. Reports of the Russian Academy of Science 362 (1998)
Zakharov, V.A.: The equivalence problem for computational models: decidable and undecidable cases. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 133–153. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Podlovchenko, R.I., Rusakov, D.M., Zakharov, V.A. (2006). On the Equivalence Problem for Programs with Mode Switching. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_34
Download citation
DOI: https://doi.org/10.1007/11605157_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)