UCaS: A Schedulability Analysis Tool for AADL Models

There is more and more the ubiquitous use of different types of real-time embedded (RTE) systems in our daily lives with rapid developments in science and technology. Because design faults might result in injury or even death to human beings who are using these systems, how to ensure the RTE systems are really safe is very important. The schedulability problem is a very important problem needs to be guaranteed in real-time software. In this paper, based on the Architecture Analysis and Design Language (AADL), we present Hybrid Automaton with Relative Time Constraints (HARTC) and Arrival Time Automaton (ATA) to abstract the semantics and external environment of each thread component in AADL respectively. Thus, we translate the schedulability problem in the system modeled by AADL into the reachability problem of locations in the product of HARTCs and ATAs. Then, we study the condition under which the reachability of HARTC is decidable. Under this condition, we develop a schedulability analysis tool called UCaS as a plug-in which can be integrated in the open source tool OSATE. We illustrate the schedulability analysis and simulation result provided by UCaS through an example. Finally, we give future directions need to be solved and our conclusion.