Verification of simple automata-based programs using the Model Checking method
Abstract
Verification of simple automata-based programs (whose behavior can be described with a singe finite automaton) is considered. The applied verification technique is based on temporal logics and is known as Model Checking. For automata-based programs it is possible to automate the process of building program model subject to verification.
Published
2007-06-20
How to Cite
Velder, S., & Shalyto, A. (2007). Verification of simple automata-based programs using the Model Checking method. Information and Control Systems, (3), 27-38. Retrieved from http://proceedings.spiiras.nw.ru/index.php/ius/article/view/14670
Issue
Section
Hardware and software resources