1246 search results - page 30 / 250 » Recursive Timed Automata |
CONCUR
2010
Springer
15 years 3 months ago
2010
Springer
JSS
2006
15 years 2 months ago
2006
118
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...
145
click to vote
ENTCS
2007
15 years 2 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...
109
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...