Abstract. Time progress conditions in hybrid systems are usually speci ed in terms of invariants, predicates characterizing states where time can continuously progress or dually, d...
In this paper1 we propose a novel approach to synthesis for low power under tight timing constraints. Starting from a mapped netlist, we apply a powerful generalized matching algo...
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Task scheduling forreactive real time systems is a di cult problem due to tight constraints that the schedule must satisfy. A static priority scheme is proposed here that can be f...
Felice Balarin, Alberto L. Sangiovanni-Vincentelli