921 search results - page 31 / 185 » On Interleaving in Timed Automata |
DSRT
2004
IEEE
15 years 5 months ago
2004
IEEE
CONCUR
2010
Springer
15 years 3 months ago
2010
Springer
JSS
2006
15 years 1 months ago
2006
115
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
142
click to vote
ENTCS
2007
15 years 1 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...