2012 IEEE 33rd Real-Time Systems Symposium 2012
DOI: 10.1109/rtss.2012.80
|View full text |Cite
|
Sign up to set email alerts
|

Monitoring Arbitrary Activation Patterns in Real-Time Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
49
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(49 citation statements)
references
References 16 publications
0
49
0
Order By: Relevance
“…The overhead is shown to be very low in FPGA implementation. Neukirchner et al [14] presented a light-weight monitoring approach for arbitrary activation patterns. The task activation patterns are modelled as minimum distance functions, which describe lower bounds on the temporal distance between consecutive activations.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The overhead is shown to be very low in FPGA implementation. Neukirchner et al [14] presented a light-weight monitoring approach for arbitrary activation patterns. The task activation patterns are modelled as minimum distance functions, which describe lower bounds on the temporal distance between consecutive activations.…”
Section: Related Workmentioning
confidence: 99%
“…Event-based monitors verify that task activations do not exceed the designed upper bound by employing arrival curve [8], [10], [14], [15]. Workload-based monitors verify that the system workload does not exceed the designed upper bound by employing WAF [13].…”
Section: Introductionmentioning
confidence: 99%
“…Watterson Heffernan (2008) present a method for using the formal Java-MaC runtime verification method to monitor a Java control system using instrumentation: The control system and monitor are implemented in a JOP (Java Optimised Processor) software processor, embedded in an FPGA (field programmable gate array) and run alongside the control system Neukirchner et al (2012) investigate the monitoring the timing of activation patterns for tasks at runtime with verification against a timing model. Uncharacteristically long or short activation times for a task could be indicative of a fault or tampering with the system.…”
Section: Runtime Verification Of Embedded Control Systemsmentioning
confidence: 99%
“…At the same time, the number of false negatives (erroneous blocking of the sequence) needs to be kept to a minimum, i.e., the blocking of non-violation behavior should be avoided in order to increase the processor utilization as much as possible. This means the pessimistic estimate is often used to strictly rule out all the violations to guarantee the safety of the system, and should be lightweight due to its frequent activations and the tight resource budgets of the system [Lampka et al, 2011;Neukirchner et al, 2012]. It is not easy for a monitoring scheme to meet both aforementioned requirements as ensuring better accuracy often requires a complex monitoring scheme, which in-turn demands more computing power.…”
Section: Introductionmentioning
confidence: 99%
“…Two state-of-the-art online monitoring algorithms have been recently developed: dynamic counters (DCs) monitoring [Lampka et al, 2011] and l-repetitive function (LRF) monitoring [Neukirchner et al, 2012]. Both monitoring algorithms are based on the arrival curve model that is capable of capturing arbitrary event arrival patterns in the time interval domain.…”
Section: Introductionmentioning
confidence: 99%