Complexity of model checking by iterative improvement: the pseudo-Boolean framework. (English) Zbl 1254.68144
Broy, Manfred (ed.) et al., Perspectives of system informatics. 5th international Andrei Ershov memorial conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9–12, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20813-5/pbk). Lecture Notes in Computer Science 2890, 381-394 (2003).
Summary: We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
For the entire collection see [Zbl 1088.68003].
For the entire collection see [Zbl 1088.68003].
MSC:
68Q60 | Specification and verification (program logics, model checking, etc.) |
68Q25 | Analysis of algorithms and problem complexity |