Bisimulation through probabilistic testing
Information and Computation
Two views of belief: belief as generalized probability and belief as evidence
Artificial Intelligence
Probabilistic non-determinism
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 3)
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating labelled Markov processes
Information and Computation
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Stably Compact Spaces and the Probabilistic Powerspace construction
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Stochastic transition systems for continuous state spaces and non-determinism
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Demonic Approach to Information in Probabilistic Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Simulation hemi-metrics between infinite-state stochastic games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Prevision domains and convex powercones
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
De groot duality and models of choice: Angels, demons and nature†
Mathematical Structures in Computer Science
A logical duality for underspecified probabilistic systems
Information and Computation
Mathematical Structures in Computer Science
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic games are just variations on continuous Markov chains. We argue that drawing at random along a belief function is the same as letting the probabilistic player P play first, then letting the non-deterministic player C play demonically. The same holds for an angelic C, using plausibilities instead. We then define a simple modal logic, and characterize simulation in terms of formulae of this logic. Finally, we show that (discounted) payoffs are defined and unique, where in the demonic case, P maximizes payoff, while C minimizes it.