570 search results - page 15 / 114 » Robustness and Implementability of Timed Automata |
74
Voted
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
ICASSP
2007
IEEE
15 years 3 months ago
2007
IEEE
In most microphone array applications, it is essential to localize sources in a noisy, reverberant environment. It has been shown that computing the steered response power(SRP) is...
75
Voted
FATES
2004
Springer
15 years 2 months ago
2004
Springer
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
TACAS
1999
Springer
15 years 1 months ago
1999
Springer
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...