Formal Analysis of Timing Effects on Closed-Loop Properties of Control Software

Frehse, Goran; Hamann, Arne; Quinton, Sophie; Woehrle, Matthias

doi:10.1109/rtss.2014.28

Cited by 60 publications

(34 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the event of a system overload or transient error, a control algorithm may tolerate a bounded number of missed deadlines; however, the system requires a number of met deadlines to return to stable operation [19]. Typical Worst-Case Analysis [21] (TWCA) exploits the fact that such overload situations are rare and usually do not occur for consecutive executions.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Mixed criticality systems with weakly-hard constraints

Gettings

Quinton

Davis

2015

Proceedings of the 23rd International Conference on Real Time and Networks Systems

Self Cite

View full text Add to dashboard Cite

Current adaptive mixed criticality scheduling policies assume a high criticality mode in which all low criticality tasks are descheduled to ensure that high criticality tasks can meet timing constraints derived from certification approved methods. In this paper we present a new scheduling policy, Adaptive Mixed Criticality -Weakly Hard, which provides a guaranteed minimum quality of service for low criticality tasks in the event of a criticality mode change. We derive response time based schedulability tests for this model. Empirical evaluations are then used to assess the relative performance against previously published policies and their schedulability tests.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The number of skips permitted and the number of subsequent deadlines that must be met (m − s) may be a requirement from the design of a control algorithm [19] or it may derive from physical properties of the system, for example with a radar altimeter it may be acceptable to drop some readings, but not to lose them altogether.…”

Section: Amc -Weakly Hardmentioning

confidence: 99%

Mixed criticality systems with weakly-hard constraints

Gettings

Quinton

Davis

2015

Proceedings of the 23rd International Conference on Real Time and Networks Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…As argued in Section 2, modern manufacturers are transitioning towards providing transient fault specifications for their sensors as that allows them to perform more sophisticated analysis [9]. However, if such a model is not provided or the sensor is operated in unfavorable environments (e.g., using a GPS while surrounded by tall buildings), it may be necessary to develop transient fault models based on empirical data.…”

Section: Transient Fault Modelingmentioning

confidence: 99%

“…In addition to classical bounded errors, manufacturers now provide transient fault specifications for their sensors [9], consisting of three dimensions: (1) the interval size, (2) window size and (3) the number of allowed faulty measurements per window. When such a specification is not provided, we note that intuitively there exists a range of interval sizes that match the underlying sensor noise model and a range that matches the underlying fault model, i.e., sometimes sensors provide measurements that are significantly farther from the true value than noisy ones.…”

Section: Introductionmentioning

confidence: 99%

Sensor attack detection in the presence of transient faults

Park

Ivanov

Weimer

et al. 2015

Proceedings of the ACM/IEEE Sixth International Conference on Cyber-Physical Systems

View full text Add to dashboard Cite

This paper addresses the problem of detection and identification of sensor attacks in the presence of transient faults. We consider a system with multiple sensors measuring the same physical variable, where some sensors might be under attack and provide malicious values. We consider a setup, in which each sensor provides the controller with an interval of possible values for the true value. While approaches exist for detecting malicious sensor attacks, they are conservative in that they treat attacks and faults in the same way, thus neglecting the fact that sensors may provide faulty measurements at times due to temporary disturbances (e.g., a tunnel for GPS). To address this problem, we propose a transient fault model for each sensor and an algorithm designed to detect and identify attacks in the presence of transient faults. The fault model consists of three aspects: the size of the sensor's interval (1) and an upper bound on the number of errors (2) allowed in a given window size (3). Given such a model for each sensor, the algorithm uses pairwise inconsistencies between sensors to detect and identify attacks. In addition to the algorithm, we provide a framework for selecting a fault model for each sensor based on training data. Finally, we validate the algorithm's performance on real measurement data obtained from an unmanned ground vehicle.

show abstract

“…For instance, the performance of an imaging application is still acceptable if once in a while a frame is lost or repeated [2]. Likewise the quality of a control application is still satisfactory if once in a while a sensor data sample is lost and the control algorithm is performed on an old sensor data sample [10]. Results from control engineering [4] could even show Lyapunov stability of the feedback control of an unstable plant that runs in open loop from time to time due to failures.…”

Section: Introductionmentioning

confidence: 99%

Finite ready queues as a mean for overload reduction in weakly-hard real-time systems

Ahrendts

Quinton

Ernst

2017

Proceedings of the 25th International Conference on Real-Time Networks and Systems

Self Cite

View full text Add to dashboard Cite

Finite ready queues, implemented by bu ers, are a system reality in embedded real-time computing systems and networks. The dimensioning of queues is subject to constraints in industrial practice, and often the queue capacity is su cient for typical system behavior but is not su cient in peak overload conditions. This may lead to over ow and consequently to the discarding of jobs. In this paper, we explore whether nite queue capacity can also be used as a mean of design in order to reduce workload peaks and thus shorten a transient overload phase. We present an analysis method which is to the best of our knowledge the rst one able to give (a) worst-case response times guarantees as well as (b) weakly-hard guarantees for tasks which are executed on a computing system with nite queues. Experimental results show that nite queue capacity may only a have weak overload limiting e ect. This unexpected outcome can be explained by the system behavior in the worst-case corner cases. The analysis shows nevertheless that a trade-o between weakly-hard guarantees and queue sizes is possible.

show abstract

Formal Analysis of Timing Effects on Closed-Loop Properties of Control Software

Cited by 60 publications

References 19 publications

Mixed criticality systems with weakly-hard constraints

Mixed criticality systems with weakly-hard constraints

Sensor attack detection in the presence of transient faults

Finite ready queues as a mean for overload reduction in weakly-hard real-time systems

Contact Info

Product

Resources

About