The colloquium takes place every week on Thursdays at lunch time (12.45 - 13.30). The emphasis is on ongoing and/or unfinished work, so as to attract possible collaborators and receive comments which could boost the quality of research.
The colloquium is intended as an opportunity for the members of our group to meet and discuss their current research. We therefore strongly encourage everyone to contribute with a presentation once in a while.
Even though the focus is primarily on the topics related to the research that takes place in the FSA section, everyone interested in the talks is most welcome to join, especially our fellow MDSE colleagues.
If you wish give a presentation, please contact Fei Yang (f.yang 'at' tue.nl).
07.12.2017 (time: 12:45, room MF 7.084)
Bas Luttik: "A Kleene theorem for pomset languages"
Abstract: We take as starting point Kleene's well-known theorem establishing a correspondence between regular expressions and finite automata: every language denoted by a regular expression is accepted by a finite automaton, and every language accepted by a finite automaton is denoted by a regular expression. We extend regular expressions with a parallel construct and finite automata with a fork construction and establish a Kleene correspondence between the two in pomset language semantics.
This may be considered as a first step towards a Kleene theorem for Concurrent Kleene Algebra (CKA), an extension of Kleene Algebra with a parallel construct, that was proposed by Hoare, M?ller, Struth and Wehrman as a suitable formal framework for the study of concurrent programs. CKA does require a different semantics satisfying the so-called exchange law between sequential and parallel composition.
The talk is based on joint work with Tobias Kappe, Paul Brunet, Alexandra Silva and Fabio Zanasi, all from UCL.
Jan Friso Groote
Allan van Hulst
Erik de Vink