Fair simulation

DOI10.1007/3-540-63141-0_19zbMath1512.68168OpenAlexW2915052813MaRDI QIDQ6044123

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

Publication date: 17 May 2023

Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63141-0_19

Mathematics Subject Classification ID

Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Simulation by Rounds of Letter-to-Letter Transducers ⋮ Simulation distances

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Fair simulation