Sciweavers

212 search results - page 11 / 43
» Completeness and Complexity of Bounded Model Checking
Sort
View
QEST
2007
IEEE
14 years 1 months ago
Stochastic Game Logic
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
Christel Baier, Tomás Brázdil, Marcu...
FOSSACS
2008
Springer
13 years 9 months ago
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
AAAI
2011
12 years 7 months ago
Complete Information Pursuit Evasion in Polygonal Environments
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the ...
Kyle Klein, Subhash Suri
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 24 days ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
STACS
2007
Springer
14 years 1 months ago
Bounded-Variable Fragments of Hybrid Logics
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
Thomas Schwentick, Volker Weber