A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
Theoretical Computer Science
STRESS: a simulator for hard real-time systems
Software—Practice & Experience
Verus: a tool for quantitative analysis of finite-state real-time systems
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
An efficient state space generation for analysis of real-time systems
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Analyzing Partially-Implemented Real-Time Systems
IEEE Transactions on Software Engineering
Information and Computation
Verification of real-time designs: combining scheduling theory with automatic formal verification
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Specification and analysis of real-time systems with PARAGON
Annals of Software Engineering
Checking Linear Duration Invariants by Linear Programming
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On Checking Timed Automata for Linear Duration Invariants
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
| Hi-index | 0.03 |
Constraints on the accumulated sojourn time at particular system states are among the possible requirements for a real-time system. These requirements are called duration properties. The need to predict temporal behavior of critical real-time systems has encouraged the development of a useful collection of results for run-time scheduling as well as an interesting set of formal automatic techniques based on model-checking. However, no automatic technique directly supports the verification of duration requirements over physical designs of real-time software. In [6] it is presented an approach that applies known scheduling theory to automatically derive simple and compositional formal models based on timed automata [1]. In this article, we combine that modeling method with a conservative algorithm that extends [5] to check duration properties over the resulting timed automata.