Qualitative and quantitative analysis with scheduling policies in model checking

An execution order of the processes in a system depends on the scheduler. Therefore, the scheduling strategy needs to be taken into account during the analysis of the system behaviors. The goal of this research is to improve the support for analyzing concurrent systems executed under different scheduling policies. A domain-specific language (DSL) is proposed to provide an effective specification of various schedulers. Necessary artifacts for the analysis are generated automatically. Based on the specification of the scheduler, an algorithm to explore the state space is realized. We use discrete time to consider a transition from a state to another state taking one time unit during the search. A graph is determined from the state space. To analyze the behaviors of the system, this graph is then labeled following an input formula which represents a qualitative/quantitative property. The results of applying our approach to several scheduling policies demonstrated that the system with scheduling policies could be analyzed accurately and easily.

[1]  Marc de Jonge,et al.  The SpinJa Model Checker , 2010, SPIN.

[2]  Toshiaki Aoki.  Model Checking Multi-Task Software on Real-Time Operating Systems , 2008, 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC).

[3]  Arnaud Gotlieb,et al.  Stress testing of task deadlines: A constraint programming approach , 2013, 2013 IEEE 24th International Symposium on Software Reliability Engineering (ISSRE).

[4]  Toshiaki Aoki,et al.  Domain-Specific Language Facilitates Scheduling in Model Checking , 2017, 2017 24th Asia-Pacific Software Engineering Conference (APSEC).

[5]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

[6]  A. Prasad Sistla,et al.  Quantitative temporal reasoning , 1990, Real-Time Systems.

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

[8]  Hassan Gomaa,et al.  Designing concurrent, distributed, and real-time applications with UML , 2000, ICSE.

[9]  Wojciech A. Trybulec.  Partially Ordered Sets , 1990 .

[10]  Abdeslam En-Nouaary,et al.  Towards a unified approach for modeling and analysis of real-time Embedded systems using MARTE/UML , 2015, Int. J. Comput. Sci. Appl..

[11]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[12]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[13]  Radek Pelánek,et al.  BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.

[14]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[15]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[16]  Albert Mo Kim Cheng,et al.  Real-time systems - scheduling, analysis, and verification , 2002 .