53 search results - page 3 / 11 » Bounded Model Checking for Region Automata |
ENTCS
2002
14 years 9 months ago
2002
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
103
click to vote
LICS
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
LPNMR
2001
Springer
15 years 1 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
73
Voted
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...