Informace o semináři Souběžnost (IA072)

Katedra teorie programování
Fakulta informatiky MU
semestr: jaro 2008

Kde: B411, pátek 10:00 - 11:50

Dosud fixovaný program

• 29. 2. 2008: domluva o programu na tento semestr
•   7. 3. 2008: Václav Brožek: Deskriptvní složitost (vybrané úvodní partie)
• 14. 3. 2008: Jan Obdržálek, Vojtěch Řehák: projekt
• 21. 3. 2008: Velký pátek - odpadá
• 28. 3. 2008: Radek Pelánek: Experimental work in explicit model checking
  (pro nemoc odpadlo, presunuto na 11.4.)
•   4. 4. 2008: Vojtěch Forejt: Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (a paper by Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Groesser)
• 11. 4. 2008: Radek Pelánek: Experimental work in explicit model checking
  Abstract: We present BEEM (BEnchmarks for Explicit Model checkers) and experiments performed over this benchmark set, e.g., study of properties of state spaces, evaluation of error detection techniques, evaluation of techniques for reducing memory consumption of model checkers.
• 18. 4. 2008: Petr Slovák: Decidable Race Conditions in High-Level Message Sequence Charts
  Abstract: The race condition problem (RCP) is known to be decidable for Message Sequence Charts (MSC) but it becomes undecidable for High-level MSC. We introduce a modification of the RCP, so called trace race condition problem, that remains decidable even for High-level MSC (with coregions). We discuss differences between the RCP and the trace RCP and we argue that our concept is useful in model based design. We also propose an algorithm solving the trace RCP and show the problem is NP-complete for High-level MSC with coregions.
• 25. 4. 2008: Jan Holeček: TBA (Tarski algebra)
•   2. 5. 2008: Jan Holeček: Tarski algebra
•   9. 5. 2008: odpada (presun na jiny termin)
• 16. 5. 2008:
• 23. 5. 2008: