A model and temporal proof system for networks of processes

DOI10.1007/BF01843567zbMath0598.68025MaRDI QIDQ1079948

B. George

Publication date: 1986

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

zbMATH Keywords

terminationmessage passingdeadlockliveness propertiesinfinite execution sequencesynchronous and asynchronous networks

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (6)

A fully abstract trace model for dataflow and asynchronous networks ⋮ TTL : a formalism to describe local and global properties of distributed systems ⋮ An operator net model for distributed systems ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ A compositional axiomatization of statecharts ⋮ An introduction to compositional methods for concurrency and their application to real-time.

Cites Work

• The incompleteness of Misra and Chandy's proof systems
• A calculus of communicating systems
• A proof technique for communicating sequential processes
• Proofs of Networks of Processes
• Ten Years of Hoare's Logic: A Survey—Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A model and temporal proof system for networks of processes