Design and verification of fault tolerant systems with CSP

DOI10.1007/BF02259751zbMath0738.68058OpenAlexW2068839623MaRDI QIDQ1176076

Jan Peleska

Publication date: 25 June 1992

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02259751

zbMATH Keywords

CSPfault tolerant systemsinvent and verify paradigmtop-down design

Mathematics Subject Classification ID

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

Related Items (2)

A trace-based compositional proof theory for fault tolerant distributed systems ⋮ Translating Testing Theories for Concurrent Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic specification and proof of a distributed recovery algorithm
• Two normal form theorems for CSP programs
• Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
• Correctness proofs of distributed termination algorithms
• A Proof System for Communicating Sequential Processes
• An axiomatic basis for computer programming

This page was built for publication: Design and verification of fault tolerant systems with CSP