A review of priority assignment in real-time systems
It is over 40 years since the first seminal work on priority assignment for real-time systems
using fixed priority scheduling. Since then, huge progress has been made in the field of real …
using fixed priority scheduling. Since then, huge progress has been made in the field of real …
Beyond just safety: Delay-aware security monitoring for real-time control systems
Modern embedded real-time systems (RTS) are increasingly facing more security threats
than the past. A simplistic straightforward integration of security mechanisms might not be …
than the past. A simplistic straightforward integration of security mechanisms might not be …
Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability
L Fortnow - … of Computational Complexity. Twelfth Annual IEEE …, 1997 - ieeexplore.ieee.org
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely,
we show that SAT cannot be solved simultaneously in n/sup 1+ 0 (1)/time and n/sup 1-/spl …
we show that SAT cannot be solved simultaneously in n/sup 1+ 0 (1)/time and n/sup 1-/spl …
Worst-case analysis of discrete systems
F Balarin - 1999 IEEE/ACM International Conference on …, 1999 - ieeexplore.ieee.org
We propose a methodology for worst-case analysis of systems with discrete observable
signals. The methodology can be used to verify different properties of systems such as …
signals. The methodology can be used to verify different properties of systems such as …
Task scheduling with RT constraints
M Di Natale, A Sangiovanni-Vincentelli… - Proceedings of the 37th …, 2000 - dl.acm.org
This paper addresses the problem of schedu ling reactive real-time tran saction s (task
groups) implementing a net work of extend ed Finite State Machines comm unicating …
groups) implementing a net work of extend ed Finite State Machines comm unicating …
[PDF][PDF] Worst-case analysis of discrete systems based on conditional abstractions
F Balarin - Proceedings of the seventh international workshop on …, 1999 - dl.acm.org
Recently, a methodology for worst-case analysis of systems with discrete observable signals
has bee” proposed [4]. We extend this methodology to make use of conditional system …
has bee” proposed [4]. We extend this methodology to make use of conditional system …
Procedure for worst-case analysis of discrete systems
F Balarin - US Patent 6,397,371, 2002 - Google Patents
(57) ABSTRACT A general methodology for worst-case analysis of Systems with discrete
observable Signals is disclosed. According to one embodiment, a Signature O is chosen …
observable Signals is disclosed. According to one embodiment, a Signature O is chosen …
Scheduling reactive task graphs in embedded control systems
M Di Natale, A Sangiovanni-Vincentelli… - … Seventh IEEE Real …, 2001 - ieeexplore.ieee.org
The development of control-dominated embedded systems can be largely automated by
making use of formal models of computation. In some of these models functional objects are …
making use of formal models of computation. In some of these models functional objects are …
Automatic synthesis of schedulers in timed systems
P Krishnan - Electronic Notes in Theoretical Computer Science, 2000 - Elsevier
In this article we present a synthesis technique for generating schedulers for real-time
systems. The aim of the scheduler is to ensure (via restricting the general behaviour) that the …
systems. The aim of the scheduler is to ensure (via restricting the general behaviour) that the …
Automatic synthesis of a subclass of schedulers in timed systems
P Krishnan - Theoretical computer science, 2003 - Elsevier
In this article we present a synthesis technique for generating schedulers for real-time
systems. The aim of the scheduler is to ensure (via restricting the general behaviour) that the …
systems. The aim of the scheduler is to ensure (via restricting the general behaviour) that the …