A timing model for synchronous language implementations in simulink

We describe a simple scheme for mapping synchronous language models, in the form of Boolean Mealy Machines, into timed automata. The mapping captures certain idealized implementation details that are ignored, or assumed away, by the synchronous paradigm. In this regard, the scheme may be compared with other approaches such as the AASAP semantics. However, our model addresses input latching and reaction triggering differently. Additionally, the focus is not on model-checking but rather on creating a semantic model for simulating synchronous controllers within Simulink. The model considers both sample-driven and event-driven execution paradigms, and clarifies their similarities and differences. It provides a means of analyzing the timing behavior of small-scale embedded controllers. The integration of the timed automata models into Simulink is described and related work is discussed. Categories and Subject Descriptors C.3 [Special-purpose and application-based systems]: Real-time and em...

• Type: Conference
• Year: 2006
• Where: EMSOFT
• Authors: Timothy Bourke, Arcot Sowmya
• Keywords: EMSOFT 2006, Software Engineering, Synchronous Language Models, Synchronous Languages, Synchronous Paradigm