This workshop aims at providing a platform for PhD students and young researchers who recently completed their doctoral studies, to exchange new results related to concurrency theory and receive feedback on their research. Focus is on informal discussions. Excellent master students working on concurrency theory are also encouraged to contribute.
YR-CONCUR 2017 is a satellite workshop of CONCUR 2017 and will be held on Monday, September 4, 2017. It is anticipated that many CONCUR participants will attend the YR-workshop (and vice versa). Presentations are selected on the basis of an abstract of up to 4 pages (incl. references) describing the research. No particular format is required. Submissions are judged on the expected interest in and quality of the talk. The accepted abstracts will be made available at the workshop, but no formal proceedings are planned. It is thus also allowed (and encouraged) to send results that have been published at other conferences (although preferably not at CONCUR 2017 or any of its other satellite workshops).
Javier Esparza (Technische Universität München, Germany)
| 09:55 - 10:00 | Welcome |
| 10:00 - 11:00 | Javier Esparza Towards efficient verification of population protocols (invited talk) |
| 11:00 - 11:30 | Coffee break |
| 11:30 - 12:00 | Jonathan Kolberg and Peter Chini On the Complexity of Bounded Context Switching |
| 12:00 - 12:30 | Elisabeth Neumann and Sebastian Muskalla Liveness Verification and Synthesis: New Algorithms for Recursive Programs |
| 12:30 - 13:00 | Kyriaki Psara Reversible Computation in Petri Nets |
| 13:00 - 14:30 | Lunch break |
| 14:30 - 15:00 | Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva Learning Automata with Side-Effects |
| 15:00 - 15:30 | Jérémy Dubut Bisimilarity of diagrams |
| 15:30 - 16:00 | Samuel Pastva Parallel Algorithm for Terminal Components Detection in Parametrised Transition Systems |
| 16:00 - 16:30 | Coffee break |
Extended abstracts of the regular talks can be found here (password protected).