PLC-automata: A new class of implementable real-time automata

  • Henning Dierks
Papers
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1231)

Abstract

We introduce a new class of automata which are tailored for dealing with real-time properties modelling the behaviour of Programmable Logic Controllers (PLC) that are often used in practice to solve controlling problems. A semantics in an appropriate temporal logic (Duration Calculus) is given and an implementation schema is presented in a programming language for PLCs that fits the semantics. Finally, a case study shows the suitability of this approach.

Keywords

Temporal Logic Programmable Logic Controller Programmable Logic Controller Time Automaton State Assertion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alur and D.L. Dill. A theory of timed automata. Theoret. Comput. Sci., 126:183–235, 1994.MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    J. Bowen, C.A.R. Hoare, H. Langmaack, E.-R. Olderog, and A.P. Ravn. ProCoS II: A ProCoS II Project Final Report, chapter 7, pages 76–99. Number 59 in Bulletin of the EATCS. European Association for Theoretical Computer Science, June 1996.Google Scholar
  3. 3.
    Zhou Chaochen. Duration Calculi: An overview. In D. Bjørner, M. Broy, and I.V. Pottosin, editors, Formal Methods in Programming and Their Application, volume 735 of Lecture Notes in Computer Science, pages 256–266. Springer-Verlag, 1993.Google Scholar
  4. 4.
    Zhou Chaochen, C.A.R. Hoare, and A.P. Ravn. A Calculus of Durations. Inform. Proc. Letters, 40/5:269–276, 1991.MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.Google Scholar
  6. 6.
    K.-H. John and M. Tiegelkamp. SPS-Programmierung mit IEC 1131-3. Springer-Verlag, 1995. in German.Google Scholar
  7. 7.
    B. Krieg-Brückner, J. Peleska, E.-R. Olderog, D. Balzer, and A. Baer. UniForM — Universal Formal Methods Workbench. In U. Grote and G. Wolf, editors, Statusseminar des BMBF Softwaretechnologie, pages 357–378. BMBF, Berlin, March 1996.Google Scholar
  8. 8.
    R.W. Lewis. Programming industrial control systems using IEC 1131-3. The institution of Electrical Engineers, 1995.Google Scholar
  9. 9.
    B. Moszkowski. A Temporal Logic for Multilevel Reasoning about Hardware. IEEE Computer, 18(2):10–19, 1985.CrossRefGoogle Scholar
  10. 10.
    A.P. Ravn, H. Rischel, and K.M. Hansen. Specifying and Verifying Requirements of Real-Time Systems. IEEE Transactions on Software Engineering, 19:41–55, January 1993.CrossRefGoogle Scholar
  11. 11.
    J.M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, second edition, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Henning Dierks
    • 1
  1. 1.University of OldenburgGermany

Personalised recommendations