A proof system for communicating shared resources

The authors introduce a proof system for CCSR, a process algebra based on the CSR model. CCSR allows the algebraic specifications of timeouts, interrupts, periodic behaviors and exceptions. A rigorous treatment of preemption, which is based not only on priority but also on resource utilization and inter-resource synchronization, is provided. The theory of preemption leads to a term equivalence based on strong bisimulation, which yields a set of laws forming the proof system. As an illustration, a resource-sharing, producer-consumer problem is presented and the authors use their laws to prove its correctness.<
>