Eternity variables to prove simulation of specifications

DOI10.1145/1042038.1042044zbMath1367.68194arXivcs/0207095OpenAlexW1976331012MaRDI QIDQ5277719

Wim H. Hesselink

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0207095

zbMATH Keywords

simulationinvariantimplementationrefinement mappinghistory variablesprophecy variablespreservation of quiescence

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Distributed algorithms (68W15)

Related Items (7)

Simulation Refinement for Concurrency Verification ⋮ Completeness of ASM Refinement ⋮ Universal extensions to simulate specifications ⋮ Finite and infinite implementation of transition systems ⋮ Simulation refinement for concurrency verification ⋮ Completeness of fair ASM refinement ⋮ Introducing extra operations in refinement

This page was built for publication: Eternity variables to prove simulation of specifications