Model-Checking Middleware-Based Event-Driven Real-Time Embedded Software

Author(s):  
Xianghua Deng ◽  
Matthew B. Dwyer ◽  
John Hatcliff ◽  
Georg Jung ◽  
Robby ◽  
...  
Author(s):  
Gabriel de Souza Pereira Moreira ◽  
Denis Ávila Montini ◽  
Daniela América da Silva ◽  
Felipe Rafael Motta Cardoso ◽  
Luiz Alberto Vieira Dias ◽  
...  

2015 ◽  
Vol 50 (10) ◽  
pp. 57-73 ◽  
Author(s):  
Casper S. Jensen ◽  
Anders Møller ◽  
Veselin Raychev ◽  
Dimitar Dimitrov ◽  
Martin Vechev
Keyword(s):  

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 556
Author(s):  
Lucia Lo Bello ◽  
Gaetano Patti ◽  
Giancarlo Vasta

The IEEE 802.1Q-2018 standard embeds in Ethernet bridges novel features that are very important for automated driving, such as the support for time-driven communications. However, cars move in a world where unpredictable events may occur and determine unforeseen situations. To properly react to such situations, the in-car communication system has to support event-driven transmissions with very low and bounded delays. This work provides the performance evaluation of EDSched, a traffic management scheme for IEEE 802.1Q bridges and end nodes that introduces explicit support for event-driven real-time traffic. EDSched works at the MAC layer and builds upon the mechanisms defined in the IEEE 802.1Q-2018 standard.


Author(s):  
Shailendra Singh ◽  
Santosh Veda ◽  
Shiv P. Singh ◽  
Rishabh Jain ◽  
Murali Mohan Baggu

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jinghao Sun ◽  
Nan Guan ◽  
Rongxiao Shi ◽  
Guozhen Tan ◽  
Wang Yi

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