Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Proof, language, and interaction
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Protocol for Loosely Time-Triggered Architectures
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Integrating Model-Based Design and Preemptive Scheduling in Mixed Time- and Event-Triggered Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Communication by sampling in time-sensitive distributed systems
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Certifying cryptographic protocols by abstract model-checking and proof concretization
ACM SIGBED Review - Special issues on workshop on innovative techniques for certification of embedded systems
Synthesis of task and message activation models in real-time distributed automotive systems
Proceedings of the conference on Design, automation and test in Europe
Loosely time-triggered architectures based on communication-by-sampling
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Semantics-preserving multitask implementation of synchronous programs
ACM Transactions on Embedded Computing Systems (TECS)
Buffer optimization in multitask implementations of Simulink models
ACM Transactions on Embedded Computing Systems (TECS)
Convincing Proofs for Program Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Time and memory tradeoffs in the implementation of AUTOSAR components
Proceedings of the Conference on Design, Automation and Test in Europe
Implementation of timed automata: an issue of semantics or modeling?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Robust and extensible task implementations of synchronous finite state machines
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
In previous work, we have proposed a method of preserving the functional semantics of model-based designs by the use of static checks and a double-buffer protocol [12]. However, this is restricted to static, fixed-priority scheduling and for high-priority to low-priority communications requires a double buffer to be stored for each pair of communicating tasks. In this paper we extend the method to dynamic-priority scheduling in the form of earliest-deadline-first (EDF) scheduling and show that, although scheduling is dynamic, a static buffering scheme can still be used. We also suggest some memory optimizations of our protocol which still preserve the original functional semantics. Finally, we show how model checking can be used to prove correctness of the scheme.