scholarly journals State Space Generation Framework Based on Binary Decision Diagram for Distributed Explicit Model Checking

2016 ◽  
Author(s):  
Nacer Tabib ◽  
Jean Michel Ilie ◽  
Djamel Eddine Saidouni
Keyword(s):  
Model Checking ◽  
State Space ◽  
Binary Decision Diagram ◽  
Explicit Model ◽  
Binary Decision ◽  
State Space Generation

A Binary Decision Diagram Based Cascade Prognostics Scheme For Power Systems

2020 ◽  
Author(s):  
Ajay Chhokra ◽  
Saqib Hasan ◽  
Abhishek Dubey ◽  
Gabor Karsai
Keyword(s):  
Power Systems ◽  
Binary Decision Diagram ◽  
Binary Decision

Method based on directed graph and binary decision diagram to break logic loops

Kerntechnik ◽  
2019 ◽  
Vol 84 (6) ◽  
pp. 488-499
Author(s):  
S. Yuan ◽  
M. Huifang
Keyword(s):  
Directed Graph ◽  
Binary Decision Diagram ◽  
Binary Decision

Embedded Nanowire Network Growth and Node Device Fabrication for GaAs-Based High-Density Hexagonal Binary Decision Diagram Quantum Circuits

2006 ◽  
Vol 45 (4B) ◽  
pp. 3614-3620 ◽  
Author(s):  
Takahiro Tamura ◽  
Isao Tamai ◽  
Seiya Kasai ◽  
Taketomo Sato ◽  
Hideki Hasegawa ◽  
...  
Keyword(s):  
Binary Decision Diagram ◽  
Device Fabrication ◽  
High Density ◽  
Quantum Circuits ◽  
Network Growth ◽  
Binary Decision ◽  
Nanowire Network

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.

Sign in / Sign up

Export Citation Format

Share Document