Stochastic game logic
DOI10.1007/S00236-012-0156-0zbMATH Open1276.68103OpenAlexW2041894791MaRDI QIDQ715046FDOQ715046
Christel Baier, Marcus Grösser, Tomáš Brázdil, Antonin Kučera
Publication date: 15 October 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0156-0
Recommendations
Probability and inductive logic (03B48) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) (n)-person games, (n>2) (91A06)
Cites Work
- Alternating-time temporal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of probabilistic verification
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Model checking of probabilistic and nondeterministic systems
- Concurrent reachability games
- Title not available (Why is that?)
- Strategy logic
- Complexity of deciding Tarski algebra
- Title not available (Why is that?)
- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
- ATL with Strategy Contexts and Bounded Memory
- Title not available (Why is that?)
- A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems
Cited In (4)
This page was built for publication: Stochastic game logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715046)