Abstract : Programmable logic controllers (PLCs) are widely used in embedded systems. A timer plays a pivotal role in PLC real-time applications. The paper presents a formalization of TON-timers of PLC programs in the theorem proving system Coq. The behavior of a timer is characterized by a set of axioms at an abstract level. PLC programs with timers are modeled in Coq. As a case study, the quiz machine problem with timer is investigated. Relevant timing properties of practical interests are proposed and proven in Coq. This work unveils the hardness of timer modeling in embedded systems. It is an attempt of formally proving the correctness of PLC programs with timer control.
Type de document :
Communication dans un congrès
33rd Annual IEEE International Computer Software and Applications Conference, Jul 2009, Seattle,Washington, United States. 2009
https://hal.inria.fr/inria-00516011
Contributeur : Hai Wan
<>
Soumis le : mardi 8 mars 2011 - 07:00:10
Dernière modification le : mardi 17 avril 2018 - 11:30:07
Document(s) archivé(s) le : samedi 3 décembre 2016 - 00:35:55
Hai Wan, Gang Chen, Xiaoyu Song, Ming Gu. Formalization and Verification of PLC Timers in Coq. 33rd Annual IEEE International Computer Software and Applications Conference, Jul 2009, Seattle,Washington, United States. 2009. 〈inria-00516011〉
