The existence of refinement mappings
Theoretical Computer Science
Forward and backward simulations I.: untimed systems
Information and Computation
Model checking
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
| Hi-index | 5.23 |
A system T is defined as implementing a system S if every infinite execution of T leads to the same observations as some infinite execution of S. System T implements S finitely if every finite execution of T leads to the same observations as some finite execution of S. It is proved that, under certain conditions on the implemented system, finite implementation implies implementation. The proof uses Konig's lemma. It is shown that the conditions are essential.