263 search results - page 33 / 53 » Rigid Tree Automata |
CONCUR
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
CICLING
2003
Springer
14 years 27 days ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
JCSS
2008
13 years 7 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
PAMI
2006
13 years 7 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...