Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
OOIS '02 Proceedings of the Workshops on Advances in Object-Oriented Information Systems
Time-Safety Checking for Embedded Programs
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Transparent distribution of real-time components based on logical execution time
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Automatic Code Generation for Synchronous Reactive Communication
ICESS '09 Proceedings of the 2009 International Conference on Embedded Software and Systems
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
Simulating real-time software components based on logical execution time
SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
Execution-time aware Simulink blocks
Proceedings of the 2012 SpringSim Poster & Work-In-Progress Track
| Hi-index | 0.00 |
Synchronous block diagrams form an established fundament for the model-based development of embedded real-time systems. Their synchronous reactive (SR), also called zero execution time, semantics offers indisputable advantages in designing, testing and verifying control algorithms but poses problems in the translation of multi-rate models into code. In this paper, we contrast the semantics of three different real-time programming paradigms and discuss a mechanism to represent them in models with SR semantics. This representation is based on MATLAB/Simulink blocks that are not characterized by the typical zero time behavior but whose execution may last for and optionally consume a finite amount of simulation time. Each such block represents a task in the sense of a real-time operating system. All tasks within a model may be scheduled with a static-priority approach. This allows us to observe simulations that are closer to the real timing behavior of control applications and also to consider preemption effects already in the simulation.