A formal approach to reactive systems software: a telecommunications application in ESTEREL
Formal Methods in System Design
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
A Methodology for Proving Control Systems with Lustre and PVS
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Syntax-driven Behavior Partitioning for Model-checking of Esterel Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards the Design of Certifiable Mixed-criticality Systems
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Real-Time Systems: Design Principles for Distributed Embedded Applications
Real-Time Systems: Design Principles for Distributed Embedded Applications
Certification-Cognizant Time-Triggered Scheduling of Mixed-Criticality Systems
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
Scheduling Real-Time Mixed-Criticality Jobs
IEEE Transactions on Computers
| Hi-index | 0.00 |
Model-based design methodologies such as Simulink/ State-flow, that are based on the synchrony assumption, are widely used in many safety-critical application domains including avionics and automotive systems. The synchrony assumption asserts that actions (such as the execution of code) occur instantaneously. However, actual platforms obviously do not satisfy the synchrony assumption. This paper considers the problem of obtaining resource-efficient implementations of programs that are written under the synchrony assumption on actual platforms, such that these implementations execute in a manner that is semantically consistent with the execution sequences that would occur if the synchrony assumption were to hold.