Partially Observable Concurrent Kleene Algebra

07/15/2020
by   Jana Wagemaker, et al.
0

We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access variables and values, which we illustrate through concrete examples. We prove that POCKA is a sound and complete axiomatisation of a model of partial observations, and show the semantics passes an important check for sequential consistency.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset