News
Next meeting this friday (and updated schedule)Written on 31.01.18 by Daniel Stan Dear Students, After this long Christmas break (happy new year !), I recall you that our next meeting takes place this Friday. Due to several time constraints, the next meeting will start early again (8:00) and consist only in one talk. The updated schedule follows, please take note also on the… Read more Dear Students, After this long Christmas break (happy new year !), I recall you that our next meeting takes place this Friday. Due to several time constraints, the next meeting will start early again (8:00) and consist only in one talk. The updated schedule follows, please take note also on the dates for writeups and reviews : 02/02/2017 at 8:00 to 9:00: Timed and Priced Timed Automata (Giles Nies) by Tom 09/02/2017 at 8:30 to 10:00: Probabilistic automata and PCCS (Daniel Stan) by Lukas and 16/02/2017: Submission of your writeup (draft) 9/03/2017: Review submission 30/03/2017: Final version of the writeup (including feedbacks from the reviews) See you on Friday.  
Feedback meeting (updated schedule)Written on 19.11.17 (last change on 31.01.18) by Daniel Stan Dears students, Thank you for all your interesting presentations on Petri Nets, the grades will soon ve registered in the system. We will give you individual feedback as part of the session on December 8, together with putting one or two short presentations on Petri Nets on stage. Since there was… Read more Dears students, Thank you for all your interesting presentations on Petri Nets, the grades will soon ve registered in the system. We will give you individual feedback as part of the session on December 8, together with putting one or two short presentations on Petri Nets on stage. Since there was no single presentation in the calibration session standing out qualitywise, we will improvise these presentations somewhat. You can find below a schedule update (some changes are there), with your "topical mentor" assigned. […] You should contact your mentor at the latest two weeks before your individual presentation. We expect you to give a 40 minutes presentation, with 10 minutes slots for questions and setup in between. Have a nice weekend !  
Assignment and next (calibration) meetingWritten on 05.11.17 (last change on 18.11.17) by Daniel Stan Dear students, Thank you for your answers to the poll, that allowed us to compile the [Schedule updated in more recent news] I will send you a separate mail with who is in charge of supervising you for… Read more Dear students, Thank you for your answers to the poll, that allowed us to compile the [Schedule updated in more recent news] I will send you a separate mail with who is in charge of supervising you for your topic. 9:00 Julian Please feel free to raise any comment or issue, Have a nice afternoon,

Topic and date selectionWritten on 23.10.17 by Daniel Stan Dear students, The poll for the topic selection is now online. You can find it in the menu, or directly at this address: I also remind you that our next meeting is on Friday November 17 at 8:00. Have a nice day !  
Advanced Concurrency Theory Seminar
Audience
This Seminar addresses Master and Bachelor students in Computer Science and related study programs that mandate participation in at least one Seminar.
The first meeting
The first meeting takes place on Friday October 20, at 10:30 in room 528 of E1 3. Next meetings will be located in the same room, on Friday, at 8:00 to 10:00.
Structure
 Calibration  Friday November 17th from 8:00 to 10:00 : 5 minutes presentation on Petri Nets (you will only present without any audience, you are not admitted to participate in the presentations of the others; we will ask the presenter of the presentation that we consider best to redo the presentation in public.)
10% of the final grade  Presentations  December and February: 45 minutes presentations, one or two presentations per week,
you probably cannot present all the material in these 45 minutes  you need to construct a good story out of the material
31% of the final grade  Writeup  draft until Friday February 16th (23:59), final version until Friday March 30th (23:59): writeup of your presentation in a book chapter style.
like in your presentation, you need to construct a good story and explain it properly therein (examples, exercises, etc.)
29% of the final grade  Reviews  until Friday March 16th (23:59): you will be assigned two writeups of your colleagues, you need to read them and give a thorough written feedback
10% of the final grade  Active participation: this involves feedback to the presentations of your colleagues and, most importantly, participation in the "scientific" discussions during and after the presentations
20% of the final grade
Overview of the seminar
This Seminar has two goals:
 to practice and to refine the skills of "scientific presentation", "scientific argumentation", and "scientific reflection";
 to learn more about various theoretically challenging and practically relevant concurrency models.
Despite its importance and more than three decades of highly active research, concurrent systems are still less understood than sequential systems. A comprehensive model of concurrency, comparable to Turing machines and the lambda calculus for sequential programs, is yet to be established for concurrency. In our seminar we will study some of the most important models and results for concurrency, and we will see why concurrency is so difficult to understand.
The goal of the seminar is to provide a broad overview of the theoretical underpinnings of concurrency theory. For example, we will discuss popular process algebras such as CCS, the pi calculus and mobile ambients. Further topics include input/output automata, modal transition systems and Petri nets as well as models of true (i.e. noninterleaving) concurrency. In addition we will look at various concurrent automata models which in different senses extend finite automata. Every such extension is motivated by a concrete practical application area. This way, we can reason about timed behaviour of realtime systems; describe behaviour of reactive systems using languages composed not of finite but of infinite words; specify classes of models using a modal automata; or reason about randomness using probabilistic automata. We will see how these modelling feature are crucial for the respective application areas.
We selected a number of papers for each of these areas. Participation in the seminar includes writing a paper to give some motivation, examples, links to relevant literature and to provide the theoretical background of the selected topic. Furthermore, each participant gives a formal presentation (approx. 45 minutes) to explain the topic to the audience.
List of papers (incomplete)

Process Algebra (in the true sense)
M. Hennessy, R. Milner: Algebraic Laws for Nondeterminism and Concurrency
R. Milner: A complete axiomatisation for observational congruence of finitestate behaviours

Bisimulation minimization
J. C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence

Simulation relations
Joachim Parrow,Peter Sjödin: Multiway synchronization verified with coupled simulation 
Parametrized verification
S. German, A. Sistla, Reasoning about Systems with Many Processes
Emerson, Kahlon: Reducing Model Checking of the Many to the Few 
Model based testing
R. De Nicola, M. Hennessy:Testing Equivalences for Processes
J. Tretmans. Model Based Testing with Labelled Transition Systems

Interface Automata
L. de Alfaro, T. A. Henzinger: Interface Automata
(for further context, see also: L. de Alfaro: Game Models for Open Systems)

Probabilistic automata and PCCS
M. Stoelinga: An introduction to probabilistic automata. Bulletin of the European Association for Theoretical Computer Science, 2002
C. Baier: On algorithmic verification methods for probabilistic systems (chapter 4)

Stochastic automata
J.P. Katoen, P. R. D'Argenio: General Distributions in Process Algebra.

Timed and priced timed automata
an overview of priced TA models: P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey. Quantitative analysis of realtime systems using priced timed automata

Hybrid automata
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.H. Hod, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine: The algorithmic analysis of hybrid systems

Multicore verification
A. Betts, N. Chong, A.F. Donaldson, J. Ketema, S. Qadeer, P. Thomson, J. Wickerson: The Design and Implementation of a Verification Technique for GPU Kernels