AN EVENT-BASED REAL-TIME LOGIC FOR THE SPECIFICATION AND ANALYSIS OF REAL-TIME SYSTEMS

1993 ◽  
Vol 02 (01) ◽  
pp. 71-91 ◽  
Author(s):  
HORNG-YUAN CHEN ◽  
JEFFREY J.P. TSAI ◽  
YAODONG BI

Research on real-time systems now focuses on formal approaches to specify and analyze the behavior of real-time systems. Temporal logic is a natural candidate for this since it can specify properties of event and state sequences. However, “pure” temporal logic cannot specify “quantitative” aspect of time. The concepts of eventuality, fairness, etc. are essentially “qualitative” treatment of time. The pure temporal logic makes no reference to absolute time. For real-time systems, the pure qualitative specification and analysis of time are inadequate. In this paper, we present a modification of temporal logic—Event-based Real-time Logic (ERL), based on our event-based conceptual model. The ERL provides a high-level framework for specifying timing properties of real-time systems, and it can be implemented using Prolog programming language. In our approach to testing and debugging of real-time systems, the ERL is used to specify both expected behavior (specification) and actual behavior (execution traces) of the target system and to verify that the target system achieves the specification. In this paper, a method is presented to implement the ERL using Prolog programming language for testing and debugging real-time systems.

Automatica ◽  
1992 ◽  
Vol 28 (6) ◽  
pp. 1288-1289
Author(s):  
L. Motus

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 651 ◽  
Author(s):  
Hyeongboo Baek ◽  
Jaewoo Lee

Hard real-time systems are employed in military, aeronautics, and astronautics fields where deployed systems are susceptible to software faults that can result in functional errors. Thus, there is a need to use fault-tolerant (FT) real-time scheduling. Among the various fault-tolerant real-time scheduling techniques, re-execution has been applied widely to existing real-time systems owing to its simplicity and applicability. However, re-execution requires multiple executions of every task, and some tasks miss their deadlines owing to the prolonged execution time; therefore, it has been found to be suitable for only soft real-time systems. In this paper, we propose an FT policy that can be incorporated into most (if not all) existing real-time scheduling algorithms on multiprocessor systems, which improves the reliability of the target system without a tradeoff against schedulability. As a case study, we apply the FT policy to existing fixed-priority scheduling and earliest deadline zero-laxity scheduling, and we demonstrate that it enhances reliability without schedulability loss.


2016 ◽  
Vol 643 ◽  
pp. 38-64 ◽  
Author(s):  
Matteo Rossi ◽  
Dino Mandrioli ◽  
Angelo Morzenti ◽  
Luca Ferrucci

Sign in / Sign up

Export Citation Format

Share Document