On verification of refinements of timed distributed algorithms

DOI10.1007/3-540-44518-8_4MaRDI QIDQ2753701zbMATH OpenFDO

Authors Anatol Slissenko, J. Cohen

Publication date 6 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44518-8_4

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Timewise refinement for communicating processes
• Timewise refinement for communicating processes
• Concurrency based transition refinement for the verification of distributed algorithms
• Real-time verification techniques for untimed systems
• scientific article; zbMATH DE number 1059321

Cited in

(7)

• Multi-scale verification of distributed synchronisation
• On the Verification of Timed Ad Hoc Networks
• Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
• Concurrency based transition refinement for the verification of distributed algorithms
• scientific article; zbMATH DE number 5042670 (Why is no real title available?)
• Proof reduction of fair stuttering refinement of asynchronous systems and applications
• Verifying time partitioning in the DEOS scheduling kernel

This page was built for publication: On verification of refinements of timed distributed algorithms

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