2632 search results - page 98 / 527 » Alternating Timed Automata |
110
click to vote
TPHOL
2008
IEEE
15 years 8 months ago
2008
IEEE
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
110
click to vote
PLANX
2008
15 years 3 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
102
click to vote
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
ALT
2010
Springer
15 years 3 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
CIT
2006
Springer
15 years 5 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...