Sciweavers

942 search results - page 25 / 189
» Interrupt Timed Automata
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Decidability and Complexity Results for Timed Automata via Channel Machines
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
PLDI
1992
ACM
13 years 11 months ago
Debugging Optimized Code with Dynamic Deoptimization
: SELF's debugging system provides complete source-level debugging (expected behavior) with globally optimized code. It shields the debugger from optimizations performed by th...
Urs Hölzle, Craig Chambers, David Ungar
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 5 months ago
Infinite Time Cellular Automata: A Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
Fabien Givors, Grégory Lafitte, Nicolas Oll...
IPL
2006
91views more  IPL 2006»
13 years 7 months ago
Improved undecidability results on weighted timed automata
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
FORMATS
2010
Springer
13 years 5 months ago
From Mtl to Deterministic Timed Automata
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...
Dejan Nickovic, Nir Piterman