101 search results - page 7 / 21 » When Are Timed Automata Determinizable |
154
click to vote
ICALP
1997
Springer
15 years 7 months ago
1997
Springer
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
113
click to vote
FUIN
2008
15 years 3 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
117
click to vote
CONCUR
1998
Springer
15 years 7 months ago
1998
Springer
In this paper we solve the following problem: \given a digital circuit composed of gates whose real-valued delays are in an integerbounded interval, is there a way to discretize ti...
125
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
145
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....