921 search results - page 80 / 185 » On Interleaving in Timed Automata |
148
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is d...
200
click to vote
ICALP
2011
Springer
14 years 9 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 ...
155
click to vote
TPHOL
2008
IEEE
16 years 20 days 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...
156
click to vote
PLANX
2008
15 years 7 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 ...
169
click to vote
DLT
2008
15 years 7 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...