76 search results - page 1 / 16 » On the Computational Complexity of Verifying One-Counter Pro... |
LICS
2009
IEEE
14 years 1 days ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
ENTCS
2006
13 years 5 months ago
2006
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
ECCC
2010
13 years 4 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...