Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

We present a framework for modeling and analysis of adaptive embedded systems, based on the model of timed automata with tasks. The model is extended with primitives allowing modeling of adaptivity, by testing the potential schedulability of a given task, in the context of the set of currently enqueued tasks. This makes it possible to describe adaptive embedded systems, in which decisions to admit further tasks or take other measures of adaptivity is based on available CPU resources, external, or internal events. We show that this model can be encoded in the framework of timed automata, and hence that the problem is decidable. We also validate the framework, by using the Uppaal tool.

[1]  Ina Schaefer.  Integrating formal verification into the model-based development of adaptive embedded systems , 2008 .

[2]  Kim G. Larsen,et al.  Schedulability Analysis Using Uppaal: Herschel-Planck Case Study , 2010, ISoLA.

[3]  Wang Yi,et al.  Code Synthesis for Timed Automata , 2003 .

[4]  Thomas Nolte,et al.  Prototyping and Code Synthesis of Hierarchically Scheduled Systems using TIMES , 2010 .

[5]  Kim G. Larsen,et al.  Model Checking Timed Automata with Priorities Using DBM Subtraction , 2006, FORMATS.

[6]  Wang Yi,et al.  Timed automata as task models for event-driven systems , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[7]  Wang Yi,et al.  TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems , 2003, FORMATS.

[8]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[9]  Wang Yi,et al.  Timed Automata with Asynchronous Processes: Schedulability and Decidability , 2002, TACAS.

[10]  Wang Yi,et al.  Task automata: Schedulability, decidability and undecidability , 2007, Inf. Comput..

[11]  Wang Yi,et al.  Schedulability analysis of fixed-priority systems using timed automata , 2006, Theor. Comput. Sci..

[12]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[13]  Kim Guldstrand Larsen,et al.  Model-Based Framework for Schedulability Analysis Using Uppaal 4.1 , 2018, Model-Based Design for Embedded Systems.

[14]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[15]  Naixue Xiong,et al.  Schedulability analysis of multi-processor real-time systems using Uppaal , 2010, The 2nd International Conference on Information Science and Engineering.

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