Proof reduction of fair stuttering refinement of asynchronous systems and applications

DOI10.4204/EPTCS.249.6MaRDI QIDQ6591111zbMATH OpenFDO

Authors Rob Sumners

Publication date 21 August 2024

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) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• scientific article; zbMATH DE number 1670505
• Completeness of fair ASM refinement
• Proving refinement using transduction
• An optimal self-stabilizing strarvation-free alternator
• scientific article; zbMATH DE number 1059321

This page was built for publication: Proof reduction of fair stuttering refinement of asynchronous systems and applications

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