Analysis of Interrupt Behavior Based on Probabilistic Model Checking

Vehicles automated driving system belongs to real-time embedded system, which is an important application in the field of intelligent transport. In the design of trustworthy real-time embedded systems, the interrupt mechanism plays an important role. Due to the randomness and non-deterministic of interrupt handling, the behaviors of interrupt are difficult to be analyzed. To solve this problem, we propose an interrupt behavior model based on extended deterministic and stochastic Petri nets (EDSPN). In order to analyze the EDSPN model, we presented the formal definition of labeled Markov regenerative processes (LMRGP) for EDSPN. On the basis of LMRGP, we put forward a probabilistic model checking method of continuous stochastic logic (CSL). Finally, by analyzing the multi-level interrupt model, the non-deterministic behaviors of interrupt are quantitatively analyzed, and effectiveness of the proposed method is proved.

[1]  Diego Latella,et al.  On-the-fly PCTL fast mean-field approximated model-checking for self-organising coordination , 2015, Sci. Comput. Program..

[2]  Lijun Zhang,et al.  When Equivalence and Bisimulation Join Forces in Probabilistic Automata , 2014, FM.

[3]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[4]  Boudewijn R. Haverkort,et al.  CSL model checking of Deterministic and Stochastic Petri Nets , 2005, MMB.

[5]  Marta Z. Kwiatkowska,et al.  Symmetry Reduction for Probabilistic Model Checking , 2006, CAV.

[6]  Holger Hermanns,et al.  ETMCC: model checking performability properties of Markov chains , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[7]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[8]  Zhou Cong.  Bounded Model Checking for Probabilistic Computation Tree Logic , 2012 .

[9]  Marta Z. Kwiatkowska,et al.  Performance analysis of probabilistic timed automata using digital clocks , 2003, Formal Methods Syst. Des..

[10]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..

[11]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[12]  Mingchu Li,et al.  Performance Evaluation for Interrupt-Driven Embedded Software Based on EDSPN , 2017, IEEE Access.