3750 search results - page 24 / 750 » Timed Automata Patterns |
WIA
2009
Springer
14 years 2 days ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
FSTTCS
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
IANDC
2007
13 years 7 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
FUIN
2002
13 years 7 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...