Translatable finite state time machine

  • Authors:
  • Krzysztof Sacha

  • Affiliations:
  • Warsaw University of Technology, Warszawa, Poland

  • Venue:
  • SDL'07 Proceedings of the 13th international SDL Forum conference on Design for dependable systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper describes syntax, behavior and formal semantics of a new class of timed automata, which are tailored for modeling the behavior of real-time systems. A formal method for automatic generation of programs is developed around this model. The method starts from modeling the desired behavior of the system under design by means of a UML-based state machine with the ability to measure time, and ends up with a complete program written in one of the IEC 1131 languages. The translation process is done automatically, and the semantics of the resulting program is isomorphic to the semantics of the model.