Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
UPPAAL - Now, Next, and Future
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Timed Automata with Asynchronous Processes: Schedulability and Decidability
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Modeling and verification of parallel processes
Code synthesis for timed automata
Nordic Journal of Computing
Mutation-Based Testing Criteria for Timeliness
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Abstracting functionality for modular performance analysis of hard real-time systems
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Formal performance evaluation of AMBA-based system-on-chip designs
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Automated Testing of Timeliness: A Case Study
AST '07 Proceedings of the Second International Workshop on Automation of Software Test
Task automata: Schedulability, decidability and undecidability
Information and Computation
Combined approach to system level performance analysis of embedded systems
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Performance estimation of distributed real-time embedded systems by discrete event simulations
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Real-time analysis of resource-constrained distributed systems by simulation-guided model checking
ACM SIGBED Review - Special issue on the RTSS forum on deeply embedded real-time computing
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
Proceedings of the 45th annual Design Automation Conference
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
System level performance analysis for real-time automotive multicore and network architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Rate admission control for hard real-time task scheduling
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
An interactive virtual guide for the AR based visit of archaeological sites
Journal of Visual Languages and Computing
Automata-Theoretic performance analysis method of soft real-time systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Embedded Systems Design
Early validation of deployment and scheduling constraints for MSC specifications
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
Adaptive task automata: a framework for verifying adaptive embedded systems
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
In this paper, we extend the classic model of timed automata with a notion of real time tasks. The main idea is to associate each discrete transition in a timed automaton with a task (an executable program). Intuitively, a discrete transition in an extended timed automaton denotes an event releasing a task and the guard on the transition specifies all the possible arriving times of the event (instead of the so--called minimal inter-arrival time). This yields a general model for hard real-time systems in which tasks may be periodic and non-periodic.We show that the schedulability problem for the extended model can be transformed to a reachability problem for standard timed automata and thus it is decidable. This allows us to apply model-checking tools for timed automata to schedulability analysis for event-driven systems. In addition, based on the same model of a system, we may use the tools to verify other properties (e.g. safety and functionality) of the system. This unifies schedulability analysis and formal verification in one framework. We present an example where the model--checker uppaal is applied to check the schedulability and safety properties of a control program for a turning lathe.