Fair Simulation
- 1 February 2002
- journal article
- Published by Elsevier in Information and Computation
- Vol. 173 (1) , 64-81
- https://doi.org/10.1006/inco.2001.3085
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An automata-theoretic approach to branching-time model checkingJournal of the ACM, 2000
- Transformational design and implementation of a new efficient solution to the ready simulation problemScience of Computer Programming, 1995
- Model checking and modular verificationACM Transactions on Programming Languages and Systems, 1994
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- The existence of refinement mappingsTheoretical Computer Science, 1991
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- An algebraic theory of fair asynchronous communicating processesTheoretical Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983