921 search results - page 34 / 185 » On Interleaving in Timed Automata |
123
click to vote
DLOG
2006
15 years 3 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
FMCAD
2006
Springer
15 years 5 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
136
click to vote
CAISE
2000
Springer
15 years 6 months ago
2000
Springer
Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurre...
113
click to vote
FORMATS
2006
Springer
15 years 5 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
108
click to vote
FORMATS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...