1246 search results - page 94 / 250 » Recursive Timed Automata |
106
click to vote
JUCS
2010
14 years 11 months ago
2010
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
136
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
101
Voted
TPHOL
2008
IEEE
15 years 7 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...
PLANX
2008
15 years 2 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 ...
120
Voted
DLT
2008
15 years 1 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...