558 search results - page 18 / 112 » Optimizing Symbolic Model Checking for Constraint-Rich Model... |
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
FORMATS
2004
Springer
14 years 1 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
ADBIS
2001
Springer
14 years 7 days ago
2001
Springer
One potential problem of active database applications is the non-termination of rules. Although algorithms have been proposed to detect non-termination, almost all provide a conser...
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
