IA072 Seminar on Concurrency

Faculty of Informatics
Autumn 2017
Extent and Intensity
0/2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Jan Strejček, Ph.D. (lecturer)
RNDr. Martin Jonáš, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jan Strejček, Ph.D.
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Fri 10:00–11:50 B411
Prerequisites
SOUHLAS
for postgraduate students; undergraduate students may ask for an exception, especially if they successfully passed IA040 Modal and Temporal Logics for Processes and IA041 Concurrency Theory and want to work in the area of concurrent processes, formal verification, or program analysis.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 15 student(s).
Current registration and enrolment status: enrolled: 0/15, only registered: 0/15, only registered with preference (fields directly associated with the programme): 0/15
fields of study / plans the course is directly associated with
Course objectives
At the end of the course students should be able to:
understand a theoretical scientific text;
make a presentation that explains main ideas of such a text;
apply information on current topics (and results) of concurrency and formal verification research areas in an eventual original research;
Learning outcomes
At the end of the course students should be able to:
understand a theoretical scientific text;
make a presentation that explains main ideas of such a text;
apply information on current topics (and results) of concurrency and formal verification research areas in an eventual original research;
Syllabus
  • Presentations of (preferably original) results from the following areas:
  • Process algebras and their specifications.
  • Infinite state systems and their hierachies.
  • Semantic equivalences and preorders.
  • Decidability and complexity of verification problems.
  • Analysis, validation, and verification of software.
Literature
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • Journal and conference papers specified by a person in charge of running seminar.
Teaching methods
seminar; every participant is expected to give a talk on a journal/conference paper (these will be specified by a person in charge of running seminar); presentations of new original results are preferred.
Assessment methods
presentations, attendance at seminars
Language of instruction
English
Further comments (probably available only in Czech)
Study Materials
The course is taught each semester.
The course is also listed under the following terms Autumn 2002, Spring 2003, Autumn 2003, Spring 2004, Autumn 2004, Spring 2005, Autumn 2005, Spring 2006, Autumn 2006, Spring 2007, Autumn 2007, Spring 2008, Autumn 2008, Spring 2009, Autumn 2009, Spring 2010, Autumn 2010, Spring 2011, Autumn 2011, Spring 2012, Autumn 2012, Spring 2013, Autumn 2013, Spring 2014, Autumn 2014, Spring 2015, Autumn 2015, Spring 2016, Autumn 2016, Spring 2017, Spring 2018, Autumn 2018, Spring 2019, Autumn 2019, Spring 2020, Autumn 2020, Spring 2021, Autumn 2021, Spring 2022, Autumn 2022, Spring 2023, Autumn 2023, Spring 2024, Autumn 2024, Spring 2025.
  • Enrolment Statistics (Autumn 2017, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2017/IA072