IA041 Concurrency Theory

Faculty of Informatics
Spring 2022
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Wed 16. 2. to Wed 11. 5. Wed 16:00–17:50 B411
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 48 fields of study the course is directly associated with, display
Course objectives
Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
Learning outcomes
At the end of the course students should be able:
to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2018
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Wed 16:00–17:50 B411
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 19 fields of study the course is directly associated with, display
Course objectives
Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
Learning outcomes
At the end of the course students should be able:
to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
Study Materials
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2016
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 16:00–17:50 B410
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 19 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
Study Materials
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2014
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 16:00–17:50 B411
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
Study Materials
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2012
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 14:00–15:50 B411
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
Study Materials
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2010
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Timetable
Mon 14:00–15:50 B411
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
Study Materials
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2006
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Timetable
Tue 10:00–11:50 B011
Prerequisites (in Czech)
! I041 Concurrency Theory && IA006 Automata
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 6 fields of study the course is directly associated with, display
Course objectives
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Assessment methods (in Czech)
viz anotace
Language of instruction
Czech
Further Comments
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2004
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer), prof. RNDr. Antonín Kučera, Ph.D. (deputy)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Timetable
Thu 16:00–17:50 B411
Prerequisites (in Czech)
! I041 Concurrency Theory && IA006 Automata
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Assessment methods (in Czech)
viz anotace
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is also listed under the following terms Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2023

The course is not taught in Spring 2023

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 49 fields of study the course is directly associated with, display
Course objectives
Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
Learning outcomes
At the end of the course students should be able:
to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2021

The course is not taught in Spring 2021

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 48 fields of study the course is directly associated with, display
Course objectives
Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
Learning outcomes
At the end of the course students should be able:
to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2020

The course is not taught in Spring 2020

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 17. 2. to Fri 15. 5. Wed 16:00–17:50 B411
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 48 fields of study the course is directly associated with, display
Course objectives
Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
Learning outcomes
At the end of the course students should be able:
to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
Study Materials
The course is taught once in two years.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2019

The course is not taught in Spring 2019

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 19 fields of study the course is directly associated with, display
Course objectives
Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
Learning outcomes
At the end of the course students should be able:
to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2017

The course is not taught in Spring 2017

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 19 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2015

The course is not taught in Spring 2015

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2013

The course is not taught in Spring 2013

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
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 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2011

The course is not taught in Spring 2011

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Prerequisites
IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Teaching methods
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. Each talk will be followed by class discussion, The number of participants is limited.
Assessment methods
seminars, active participation (giving talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2009

The course is not taught in Spring 2009

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Prerequisites (in Czech)
IA006 Automata theory
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 15 fields of study the course is directly associated with, display
Course objectives
Main objectives can be summarized as follows: to understand the basic techniques used for modelling, analysis and verification od concurrent processes. This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Assessment methods
seminars, active participation (talks, discussions)
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2008

The course is not taught in Spring 2008

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Prerequisites (in Czech)
IA006 Automata theory
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 18 fields of study the course is directly associated with, display
Course objectives
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Assessment methods (in Czech)
viz anotace
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2007

The course is not taught in Spring 2007

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Prerequisites (in Czech)
! I041 Concurrency Theory && IA006 Automata theory
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 6 fields of study the course is directly associated with, display
Course objectives
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Assessment methods (in Czech)
viz anotace
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2005

The course is not taught in Spring 2005

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer), prof. RNDr. Antonín Kučera, Ph.D. (deputy)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Prerequisites (in Czech)
! I041 Concurrency Theory && IA006 Automata
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
there are 6 fields of study the course is directly associated with, display
Course objectives
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Assessment methods (in Czech)
viz anotace
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
http://www.fi.muni.cz/usr/kretinsky/
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.

IA041 Concurrency Theory

Faculty of Informatics
Spring 2003

The course is not taught in Spring 2003

Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Mojmír Křetínský, CSc. (lecturer), prof. RNDr. Antonín Kučera, Ph.D. (deputy)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Mojmír Křetínský, CSc.
Prerequisites (in Czech)
! I041 Concurrency Theory && IA006 Automata
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
there are 6 fields of study the course is directly associated with, display
Course objectives
This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.
Syllabus
  • Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
  • Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
  • Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.
Literature
  • BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
  • Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
  • BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
  • Články z časopisů a sborníků konferencí, dle specifikace vyučujícího
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
The course is also listed under the following terms Spring 2004, Spring 2006, Spring 2010, Spring 2012, Spring 2014, Spring 2016, Spring 2018, Spring 2022.
  • Enrolment Statistics (recent)