Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework

14 years 5 months ago

Download www.dbai.tuwien.ac.at

We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying inﬁnite games pertinent to computer-aided veriﬁcation.

Henrik Björklund, Sven Sandberg, Sergei G. Vo

Real-time Traffic

Computer-aided Veriﬁcation | ERSHOV 2003 | Inﬁnite Games | Upper Bounds |

claim paper

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	ERSHOV
Authors	Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov

Comments (0)

Sciweavers

Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework

Computer-aided Veriﬁcation | ERSHOV 2003 | Inﬁnite Games | Upper Bounds |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers