Statecharts: A visual formalism for complex systems
Science of Computer Programming
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Generating embedded software from hierarchical hybrid models
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Code Generation from Hybrid Systems Models for Distributed Embedded Systems
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Describing Multidimensional Schedules for Media-Access Control in Time-Triggered Communication
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
A Verifiable Language for Programming Real-Time Communication Schedules
IEEE Transactions on Computers
Generating Sound and Resource-Aware Code from Hybrid Systems Models
Model-Driven Development of Reliable Automotive Services
| Hi-index | 0.01 |
Hybrid systems are an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. A simple extension, a network of communicating hybrid automata, allows for modeling distributed embedded systems. Although it is possible to generate code from such models, it is difficult to provide formal guarantees in the code with respect to the model. One of the reasons for this is that, the model is set in continuous time and concurrent execution with instantaneous communication, whereas the generated code is set in discrete time with delayed communication. This can introduce semantic differences between the model and the code such as missed transitions, faulty transitions, and altered continuous behavior. The goal of faithful code generation is to minimize these differences.In this paper, we propose a relaxed criteria of faithfulness, coined relative faithful implementation. Based on this criteria, we propose dynamically adjusting the guard at runtime using estimates of errors for preventing faulty transitions. We also identify a sufficient condition to ensure no missed transitions in the code.