Splitting forward simulations to cope with liveness

DOI10.1007/S00236-006-0007-YMaRDI QIDQ2491215zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 26 May 2006

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-006-0007-y

Mathematics Subject Classification ID

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

Recommendations

• On the refinement of liveness properties of distributed systems
• Forward and backward simulations. I. Untimed Systems
• Fair simulation
• Fair simulation
• Universal extensions to simulate specifications

Cites work

• Deadlock and fairness in morphisms of transition systems
• Forward and backward simulations. I. Untimed Systems
• How to Write a Proof
• scientific article; zbMATH DE number 3943003 (Why is no real title available?)
• scientific article; zbMATH DE number 2090023 (Why is no real title available?)
• Refinement verification of the lazy caching algorithm
• The existence of refinement mappings
• Using eternity variables to specify and prove a serializable database interface

Cited in

(9)

• Universal extensions to simulate specifications
• Refinement verification of the lazy caching algorithm
• A distributed resource allocation algorithm for many processes
• Starvation-free mutual exclusion with semaphores
• Simulation Refinement for Concurrency Verification
• Completeness of ASM refinement
• Simulation refinement for concurrency verification
• Completeness of fair ASM refinement
• A criterion for atomicity revisited

This page was built for publication: Splitting forward simulations to cope with liveness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491215)