64 search results - page 10 / 13 » Real-Counter Automata and Their Decision Problems |
155
click to vote
ICALP
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. In this paper we de ne a precise notion of abstraction relation between continuous dynamical systems and discrete state-transition systems. Our main result states that ev...
152
click to vote
SODA
2010
ACM
16 years 3 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...
208
click to vote
FSTTCS
2010
Springer
15 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...
178
click to vote
LICS
2008
IEEE
16 years 8 days ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
273
click to vote
POPL
2002
ACM
16 years 6 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...