1701 search results - page 219 / 341 » Computer Science and State Machines |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....
FM
2009
Springer
15 years 4 months ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...