Two normal form theorems for CSP programs

DOI10.1016/0020-0190(87)90001-9zbMath0631.68026OpenAlexW1976295241MaRDI QIDQ1094869

Luc Bougé, Ph. Clermont, Krzysztof R. Apt

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10291

zbMATH Keywords

deadlock freedompartially interpreted computationsyntactic equivalence

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (7)

Two normal form theorems for CSP programs ⋮ Fairness and the axioms of control predicates ⋮ Appraising fairness in languages for distributed programming ⋮ Design and verification of fault tolerant systems with CSP ⋮ Fifty years of Hoare's logic ⋮ Fairness and hyperfairness in multi-party interactions ⋮ Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP

Uses Software

• CESAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two normal form theorems for CSP programs
• Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
• Closed Covers: To Verify Progress for Communicating Finite State Machines
• Correctness proofs of distributed termination algorithms
• On folk theorems
• Distributed Termination
• Some Properties of Predicate Transformers
• Communicating sequential processes

This page was built for publication: Two normal form theorems for CSP programs