![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Concurrent Kleene Algebra: free model and completeness
Concurrent Kleene Algebra: free model and completenessAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Paul Taylor. Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. Up until now, a description of the free model that corresponds to the CKA axioms was missing. Using a fixpoint construction, we show that the free model of the fragment of CKA with bounded parallelism consists of pomset languages that are downward-closed under the subsumption (linearisation) order. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsPostgraduate Seminars in the School of Computer Science EPS - College Research Teas Type the title of a new list hereOther talksWaveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy TBA TBA TBA Life : it’s out there, but what and why ? Quantum Sensing in Space |