Nie jesteś zalogowany |
Deciding branching bisimilarity on BPA in NEXPTIME
- Prelegent(ci)
- Wojciech Czerwiński
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 14 maja 2014 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
Branching bisimilarity is a variant of the weak bisimilarity. Recently there was a big progress in deciding bisimilarity on context-free systems: decidability was shown. I will present the main ideas of this result and explain how to improve it to NEXPTIME.
