English

Eternity variables to prove simulation of specifications

Distributed, Parallel, and Cluster Computing 2007-05-23 v4 Logic in Computer Science

Abstract

Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. A specification implements another specification if and only if there is a simulation from the first one to the second one that satisfies a certain condition. By adding stutterings, the formalism allows that the concrete behaviours take more (or possibly less) steps than the abstract ones. Eternity variables are introduced as a more powerful alternative for prophecy variables and backward simulations. This formalism is semantically complete: every simulation that preserves quiescence is a composition of a forward simulation, an extension with eternity variables, and a refinement mapping. This result does not need finite invisible nondeterminism and machine closure as in the Abadi-Lamport Theorem. Internal continuity is weakened to preservation of quiescence.

Keywords

Cite

@article{arxiv.cs/0207095,
  title  = {Eternity variables to prove simulation of specifications},
  author = {Wim H. Hesselink},
  journal= {arXiv preprint arXiv:cs/0207095},
  year   = {2007}
}

Comments

28 pages, to appear in ACM-TOCL

R2 v1 2026-07-22T12:20:09.749Z