516 search results - page 9 / 104 » Generalizing the Discrete Timed Automaton |
FOSSACS
2011
Springer
13 years 1 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
SIAMNUM
2010
13 years 4 months ago
2010
This paper deals with error estimates for space-time discretizations in the context of nary variational inequalities of rate-independent type. After introducing a general abstract ...
SIAMCO
2010
13 years 4 months ago
2010
We study the optimal input-output stabilization of discrete time-invariant linear systems in Hilbert spaces by output injection. We show that a necessary and sufficient condition ...
BIRTHDAY
1994
Springer
14 years 1 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...