Analysis of real-time code by model checking

2002 ◽  
Author(s):  
D. Guaspari ◽  
D. Naydich
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Time Code

Predictable Parallel Real-time Code Generation

1993 ◽  
Vol 26 (2) ◽  
pp. 701-704
Author(s):  
M.R. Webster ◽  
D.C. Levy ◽  
R.G. Harley ◽  
D.R. Woodward ◽  
M. vd Westhuizen ◽  
...  
Keyword(s):  
Real Time ◽  
Code Generation ◽  
Time Code

Schedulability Analysis for Timed Automata With Tasks

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jinghao Sun ◽  
Nan Guan ◽  
Rongxiao Shi ◽  
Guozhen Tan ◽  
Wang Yi
Keyword(s):  
Model Checking ◽  
State Space ◽  
Real Time ◽  
Timed Automata ◽  
Schedulability Analysis ◽  
Scheduling Theory ◽  
Real Time Scheduling ◽  
Analysis Techniques ◽  
Model Complex ◽  
Time Scheduling

Research on modeling and analysis of real-time computing systems has been done in two areas, model checking and real-time scheduling theory. In model checking, an expressive modeling formalism such as timed automata (TA) is used to model complex systems, but the analysis is typically very expensive due to state-space explosion. In real-time scheduling theory, the analysis techniques are highly efficient, but the models are often restrictive. In this paper, we aim to exploit the possibility of applying efficient analysis techniques rooted in real-time scheduling theory to analysis of real-time task systems modeled by timed automata with tasks (TAT). More specifically, we develop efficient techniques to analyze the feasibility of TAT-based task models (i.e., whether all tasks can meet their deadlines on single-processor) using demand bound functions (DBF), a widely used workload abstraction in real-time scheduling theory. Our proposed analysis method has a pseudo-polynomial time complexity if the number of clocks used to model each task is bounded by a constant, which is much lower than the exponential complexity of the traditional model-checking based analysis approach (also assuming the number of clocks is bounded by a constant). We apply dynamic programming techniques to implement the DBF-based analysis framework, and propose state space pruning techniques to accelerate the analysis process. Experimental results show that our DBF-based method can analyze a TAT system with 50 tasks within a few minutes, which significantly outperforms the state-of-the-art TAT-based schedulability analysis tool TIMES.

scholarly journals On the Complexity of Scheduling Conditional Real-Time Code

2001 ◽  
pp. 38-49 ◽  
Author(s):  
Samarjit Chakraborty ◽  
Thomas Erlebach ◽  
Lothar Thiele
Keyword(s):  
Real Time ◽  
Time Code

scholarly journals Symbolic Model Checking for Real-Time Systems

1994 ◽  
Vol 111 (2) ◽  
pp. 193-244 ◽  
Author(s):  
T.A. Henzinger ◽  
X. Nicollin ◽  
J. Sifakis ◽  
S. Yovine
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Symbolic Model Checking ◽  
Real Time Systems ◽  
Symbolic Model ◽  
Time Systems

Modeling and analyzing real-time wireless sensor and actuator networks using actors and model checking

2017 ◽  
Vol 20 (5) ◽  
pp. 547-561 ◽  
Author(s):  
Ehsan Khamespanah ◽  
Marjan Sirjani ◽  
Kirill Mechitov ◽  
Gul Agha
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Wireless Sensor

KRONOS — Model Checking of Real-time Systems

2001 ◽  
pp. 161-168
Author(s):  
Béatrice Bérard ◽  
Michel Bidoit ◽  
Alain Finkel ◽  
François Laroussinie ◽  
Antoine Petit ◽  
...  
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Real Time Systems ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document