You are not logged in |
Languages of higher dimensional automata and Kleene theorem
- Speaker(s)
- Krzysztof Ziemiański
- Affiliation
- UW
- Date
- Nov. 23, 2021, 4:30 p.m.
- Information about the event
- zoom : 892 1108 9551 Password - type the number equal to rk(H^2((S^1)^{200};Z))
- Seminar
- Seminar Algebraic Topology
Higher dimensional automata (HDA) are a formalism for modeling concurrent systems introduced by Pratt and van Glabbeek. I will present several ways to define languages of HDA, which are collections of interval pomsets closed under subsumption. Then I will define regular interval pomset languages and formulate Kleene theorem for HDA. Finally, I will sketch its proof, which employs some ideas derived from topology and geometry.
(joint work with U. Fahrenberg, C. Johansen, G. Struth)
