Modeling the distributed termination convention of CSP

DOI10.1145/579.584zbMath0536.68018OpenAlexW2070373441MaRDI QIDQ3321434

Nissim Francez, Krzysztof R. Apt

Publication date: 1984

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

program transformationdistributed programmingdeadlock

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (3)

Transformations for communication fairness in CSP ⋮ On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes ⋮ A distributed algorithm for distributed termination

This page was built for publication: Modeling the distributed termination convention of CSP