Fair simulation

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

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

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

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Applicability of fair simulation, Bridging the gap between fair simulation and trace inclusion

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