David, Alexandre1; Larsen, Kim Guldstrand4; Legay, Axel2; Mikučionis, Marius2
1 Distributed Systems and Semantics, Department of Computer Science, The Technical Faculty of IT and Design, Aalborg University2 Department of Computer Science, The Technical Faculty of IT and Design, Aalborg University3 The Faculty of Engineering and Science (TECH), Aalborg University4 CISS - Center for Embedded Software Systems, Department of Computer Science, The Technical Faculty of IT and Design, Aalborg University5 Aalborg U Robotics, Department of Communication and Psychology, The Faculty of Humanities, Aalborg University
Schedulability analysis is a main concern for several embedded applications due to their safety-critical nature. The classical method of response time analysis provides an efficient technique used in industrial practice. However, the method is based on conservative assumptions related to execution and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques to obtain some guarantee on the (un)schedulability of the model even in the presence of undecidability. Two methods are considered: symbolic model checking and statistical model checking. Since the model uses stop-watches, the reachability problem becomes undecidable so we are using an over-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter-examples that are always realizable. Another use of the SMC technique is to do performance analysis on schedulable configurations to obtain, e.g., expected response times. The methods are demonstrated on a complex satellite software system yielding new insights useful for the company.
International Journal on Software Tools for Technology Transfer, 2015, Vol 17, Issue 2, p. 187-199
statistical model checking; symbolic model checking; performance analysis; Schedulability Analysis