The equivalence problem of multitape finite automata
Theoretical Computer Science
On the equivalence and transformation of program schemes
Communications of the ACM
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On Program Schemes with Commuting and Monotone Operators
Programming and Computing Software
A new decidable problem, with applications
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The equivalence problem for deterministic two-tape automata
Journal of Computer and System Sciences
Program equivalence checking by two-tape automata
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
We study the equivalence-checking problem for a formal model of computer programs which is used for the purpose of verification. In this model programs are viewed as deterministic finite automata operating on Kripke structures defined in the framework of dynamic logics. When a transition relation in such structures is functional and weakly directed, the result of a program execution does not depend on the order in which basic statements are applied to data states. The models of programs with commuting statements have a close relationship to multi-tape finite automata. We consider the case when evaluation functions which specify truth-values of basic predicates in programs are monotonic. This corresponds to multi-tape automata operating on binary words of the type 0*1*. The main theorem states that the equivalence-checking problem in the model of programs with commuting and monotonic statements is decidable in polynomial time.