Referenced Items are not available for this document.
Programmable logic controllers (PLCs) are widely used in embedded systems. Timers play a pivotal role in PLC real-time applications. The formalisation of timers is of great importance. The study presents a formalisation of PLC timers in the theorem proving system Coq, in which the behaviours of timers are characterised by a set of axioms at an abstract level. The authors discuss how to model timers at a proper and sound abstract level. PLC programs with timers are modelled. As a case study, a quiz machine problem with a timer is investigated. This work demonstrates the complexity of formal timer modelling.
Published in:
Software, IET
(Volume:5
,
Issue:
1
)
Date of Publication: February 2011
- Page(s):
- 32 - 42
- ISSN :
- 1751-8806
- INSPEC Accession Number:
- 11821868
- Digital Object Identifier :
- 10.1049/iet-sen.2010.0002
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 22 February 2011
- Issue Date :
- February 2011
- Sponsored by :
- Institution of Engineering and Technology
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
