Translatable finite state time machine

作者: Krzysztof Sacha

DOI: 10.1007/978-3-540-74984-4_8

关键词:

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

参考文章(20)
Roberto Segala, Frits Vaandrager, Dilsun K. Kaynar, Nancy Lynch, The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science) Morgan & Claypool Publishers. ,(2006)
Demissie B. Aredo, Semantics of UML Statecharts in PVS ,(2003)
Vincent Danos, Jean Krivine, Reversible Communicating Systems CONCUR 2004 - Concurrency Theory. ,vol. 3170, pp. 292- 307 ,(2004) , 10.1007/978-3-540-28644-8_19
Josef Tapken, Henning Dierks, MOBY/PLC - Graphical Development of PLC-Automata Lecture Notes in Computer Science. pp. 311- 314 ,(1998) , 10.1007/BFB0055360
Bruce Powel Douglass, Real-time UML ,(1997)
Krzysztof Sacha, Automatic Code Generation for PLC Controllers Lecture Notes in Computer Science. pp. 303- 316 ,(2005) , 10.1007/11563228_23
Dino Mandrioli, Constance Heitmeyer, Formal Methods for Real-Time Computing John Wiley & Sons, Inc.. ,(1996)
Sabine Kuske, A Formal Semantics of UML State Machines Based on Structured Graph Transformation Lecture Notes in Computer Science. pp. 241- 256 ,(2001) , 10.1007/3-540-45441-1_19
Pavel Krčál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi, Timed vs. Time-Triggered Automata CONCUR 2004 - Concurrency Theory. pp. 340- 354 ,(2004) , 10.1007/978-3-540-28644-8_22