On Probabilistic Alternating Simulations

This paper presents simulation-based relations for probabilistic game structures. The first relation is called probabilistic alternating simulation, and the second called probabilistic alternating forward simulation, following the naming convention of Segala and Lynch. We study these relations with respect to the preservation of properties specified in probabilistic alternating-time temporal logic.

• Publication year

  2010

• Venue

  IFIP TCS

• Publication date

  2010-03-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-15240-5_6arXiv 1003.0788
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computationally Sound Analysis of a Probabilistic Contract Signing Protocol

  2009cited by this paper
• Observing Branching Structure through Probabilistic Contexts

  2007cited by this paper
• Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm

  2007cited by this paper
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems

  2007cited by this paper
• Theory of Games and Economic Behavior

  2006cited by this paper
• The complexity of quantitative concurrent parity games

  2006cited by this paper
• Quantitative solution of omega-regular games

  2004cited by this paper
• Weak bisimulation is sound and complete for pCTL*

  2002cited by this paper
• Deciding Bisimilarity and Similarity for Probabilistic Processes

  2000cited by this paper
• Concurrent reachability games

  1998cited by this paper
• Alternating Refinement Relations

  1998influential reference
• Alternating Re nement Relations ? ? ?

  1998influential reference
• The determinacy of Blackwell games

  1998influential reference
• Alternating-time temporal logic

  1997cited by this paper
• Modeling and verification of randomized distributed real-time systems

  1996influential reference
• A Compositional Trace-Based Semantics for Probabilistic Automata

  1995influential reference
• Probabilistic Simulations for Probabilistic Processes

  1994influential reference
• Time and probability in formal design of distributed systems

  1994cited by this paper
• Algorithms for stochastic games — A survey

  1991cited by this paper
• Automata on Infinite Objects

  1991cited by this paper
• Temporal and Modal Logic

  1991influential reference
• Reactive, generative, and stratified models of probabilistic processes

  1990cited by this paper
• Communication and concurrency

  1989cited by this paper

• Fuzzy Alternating Refinement Relations Under the Gödel Semantics

  2021cites this paper
• Modal characterisation of simulation relations in probabilistic concurrent games

  2021cites this paper
• Characterising Probabilistic Alternating Simulation for Concurrent Games

  2019cites this paper
• Verification and control for probabilistic hybrid automata with finite bisimulations

  2019cites this paper
• Simulations for Multi-Agent Systems with Imperfect Information

  2019cites this paper
• Data-driven and model-based methods for verification and control of physical systems

  2017cites this paper
• Certified policy synthesis for general Markov decision processes: An application in building automation systems

  2017cites this paper
• Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement

  2016influential citation
• Abstraction and refinement of probabilistic automata using modal stochastic games

  2015cites this paper
• Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall

  2012cites this paper
• Automatic verification of competitive stochastic systems

  2012cites this paper
• An Algorithm for Probabilistic Alternating Simulation

  2011cites this paper