Fair simulation

DOI10.1006/inco.2001.3085zbMath1009.68071OpenAlexW2914000465MaRDI QIDQ1854506

Sriram K. Rajamani, Thomas A. Henzinger, Orna Kupferman

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1c9a348bcf32385d9318bd7c644bd65e7a5baea3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning, Bisimulation maps in presheaf categories, Applicability of fair simulation, Graph Games and Reactive Synthesis, Matching in security-by-contract for mobile code, Simulation relations and applications in formal methods, Randomness for free, A survey of stochastic \(\omega \)-regular games, Latticed Simulation Relations and Games, History-deterministic timed automata are not determinizable, Unnamed Item, Model-checking process equivalences, LATTICED SIMULATION RELATIONS AND GAMES, Büchi Automata Can Have Smaller Quotients, A survey of partial-observation stochastic parity games, Strategy synthesis for multi-dimensional quantitative objectives, Quantitative fair simulation games, Bridging the gap between fair simulation and trace inclusion, Strategy logic, Multi-buffer simulations: decidability and complexity, Unnamed Item, An inventory-transportation system with stochastic demand, OBLIGATION BLACKWELL GAMES AND P-AUTOMATA, Minimizing GFG Transition-Based Automata, BÜCHI COMPLEMENTATION MADE TIGHTER, Game-theoretic simulation checking tool, Topological Characterisation of Multi-Buffer Simulation, Automata on infinite trees, The Gibbs cloner for combinatorial optimization, counting and sampling

Cites Work

• The existence of refinement mappings
• An algebraic theory of fair asynchronous communicating processes
• The complementation problem for Büchi automata with applications to temporal logic
• Transformational design and implementation of a new efficient solution to the ready simulation problem
• Specifying Concurrent Program Modules
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Equivalences for fair Kripke structures
• Divergence and fair testing
• An automata-theoretic approach to branching-time model checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item