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.

[1]  S. Vestal,et al.  MetaH support for real-time multi-processor avionics , 1997, Proceedings of 5th International Workshop on Parallel and Distributed Real-Time Systems and 3rd Workshop on Object-Oriented Real-Time Systems.

[2]  Peter H. Feiler,et al.  Dependability Modeling with the Architecture Analysis & Design Language (AADL) , 2007 .

[3]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[4]  Rajeev Alur,et al.  Timed Automata , 1999, CAV.

[5]  Wang Yi,et al.  Compositional and symbolic model-checking of real-time systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[6]  Wang Yi,et al.  TIMES - A Tool for Modelling and Implementation of Embedded Systems , 2002, TACAS.

[7]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[8]  Pravin Varaiya,et al.  Suspension Automata: A Decidable Class of Hybrid Automata , 1994, CAV.

[9]  Karama Kanoun,et al.  A System Dependability Modeling Framework Using AADL and GSPNs , 2006, WADS.

[10]  Jörgen Hansson,et al.  Flow Latency Analysis with the Architecture Analysis and Design Language (AADL) , 2007 .

[11]  François Laroussinie,et al.  Model-Checking for Hybrid Systems by Quotienting and Constraints Solving , 2000, CAV.

[12]  Duncan Clarke,et al.  Schedulability analysis of AADL models , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[13]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[14]  Oded Maler,et al.  Job-Shop Scheduling Using Timed Automata , 2001, CAV.

[15]  Wang Yi,et al.  Compositional and Symbolic Model-Checking of Real-Time Systems , 1996 .

[16]  Lijie Wang,et al.  Formal Schedulability Analysis and Simulation for AADL , 2008, 2008 International Conference on Embedded Software and Systems.

[17]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[18]  Wang Yi,et al.  Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata , 2004, TACAS.