135 search results - page 7 / 27 » Relating timed and register automata |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Sampled semantics of timed automata is a nite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems ed granularity of ti...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
CC
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...