128 search results - page 13 / 26 » Game Characterizations of Process Equivalences |
LICS
2000
IEEE
14 years 4 hour ago
2000
IEEE
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Cognitive Radio Networks aim at enhancing spectrum utilization by allowing cognitive devices to opportunistically access vast portions of the spectrum. To reach such amb...
LICS
2008
IEEE
14 years 2 months 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...
FSTTCS
2010
Springer
13 years 5 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...
SODA
2010
ACM
14 years 5 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...