Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
Science of Computer Programming - Special issue on concurrent constraint programming
Meeting Deadlines in Hard Real-Time Systems
Meeting Deadlines in Hard Real-Time Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A Formal Model of Partitioning for Integrated Modular Avionics
A Formal Model of Partitioning for Integrated Modular Avionics
Partitioning in Avionics Architectures: Requirements, Mechanisms, and Assurance
Partitioning in Avionics Architectures: Requirements, Mechanisms, and Assurance
Theoretical Computer Science
A step-wise approach for integrating QoS throughout software development
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Hi-index | 0.00 |
Real-time embedded systems can be used in hightly important or even vital tasks (avionic and medical systems, etc.), thus having strict temporal constraints that need to be validated. Existing solutions use temporal logic, automata or scheduling techniques. However, scheduling techniques are often pessimistic and require an almost complete knowledge of the system, and formal methods can be ill-fitted to manipulate some of the concepts involved in real-time systems. In this article, we propose a method that gives to the designer the advantages of formal methods and some simplicity in manipulating real-time systems notions. This method is able to model and validate all the classical features of real-time systems, without any pessimism, while guaranteeing the terminaison of the validation process. Moreover, its formalism enables to study systems of which we have only a partial knowledge, and thus to validate or invalidate a system still under design. This latest point is very important, since it greatly decreases the cost of design backtracks.