128
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
127
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
140
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In many safety-critical applications of embedded systems, the system dynamics exhibits hybrid behaviors. To enable automatic analysis of these embedded systems, many analysis tools...
134
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
121
Voted
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...