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 …

STARS of MPEG decoder: a case study in worst-case analysis of discrete-event systems

F Balarin - Proceedings of the ninth international symposium on …, 2001 - dl.acm.org
STARS (STatic Analysis of Reactive Systems) is a methodology for worst-case analysis of
discrete systems. Theoretical foundations of STARS have been laid down [1, 2, 3], but no …

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 …

Periodic instrumental variable identification

SS Wilson, CL Carnal - 1993 (25th) Southeastern Symposium …, 1993 - ieeexplore.ieee.org
An approach to the selection and use of instruments in which the input signal is restricted to
be a periodic pseudorandom binary sequence (PRBS) is proposed. The method exploits the …

[PDF][PDF] Automatic abstraciton for worst-case analysis of discrete systems

F Balarin - Proceedings of the conference on Design, automation …, 2000 - dl.acm.org
Recently, a methodology for worst-case analysis of discrete systems has been proposed [1,
2]. The methodology relies on a user-provided abstraction of system components. In this …

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 …