Fair simulation
type: Item
instance of: scholarly article
title: Fair simulation
zbMATH Open document ID: 1009.68071
author: Thomas A. Henzinger
author: Orna Kupferman
author: Sriram K. Rajamani
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 1853240
MaRDI profile type: Publication
OpenAlex ID: W2914000465
cites work: The existence of refinement mappings
cites work: Equivalences for fair Kripke structures
cites work: Transformational design and implementation of a new efficient solution to the ready simulation problem
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Divergence and fair testing
cites work: An algebraic theory of fair asynchronous communicating processes
cites work: Q4252730
cites work: Q4518901
cites work: Q4542592
cites work: An automata-theoretic approach to branching-time model checking
cites work: Specifying Concurrent Program Modules
cites work: Q3126969
cites work: Q3694687
cites work: Q5616162
cites work: The complementation problem for Büchi automata with applications to temporal logic
cites work: Q4131648
DOI: 10.1006/INCO.2001.3085
description: scientific article; zbMATH DE number 1853240