Module details

M1101-CMS72  Models of Computation

Module Owner: N.N.
Displayed in timetable as: CMS-LM-MOC
Duration: 3
Number of electives: 0
Credits: 15,0
Start Semester: SuSe 2021
Lecturer Responsible Prof. Dr. Markus Krötzsch
markus.kroetzsch@tu-dresden.de
Qualification Goals The students have extensive skills in modelling calculation processes and in analysing their properties. They are familiar with methods for the abstraction of algorithms and programmes and are able to apply these methods to investigate calculations qualitatively and quantitatively. They have sound knowledge of various classical and non-classical computational models.
Content The content of the module depends on the student’s main focus: computational models including Turing machines, automata, hybrid and quantitative models, stochastic models, biologically motivated models, term substitution systems and quantum computers; analysis of computability, complexity, correctness, termination, declarative semantics and functional properties as well as methods used for these, including verification and mathematic modelling of relevant properties.
Forms of Teaching and Learning The module includes a lecture, a practical, a seminar, tutorials, an internship, and project work amounting to 12 hours per week plus independent study. Courses are to be selected from the CMS-LM-MOC catalogue to the extent indicated; this catalogue, including the language of the course, the required graded work and the weighting of the grade, will be announced at the beginning of the semester as is customary at the Faculty of Computer Science.
Prerequisites for Participation No previous specialist knowledge is required.
Applicability This is a compulsory module for students of the track Logical Modelling in the Master degree programme Computational Modelling and Simulation.
Prerequisites for the Assignment of Credit Points The credit points are awarded if the module examination is passed. The module examination consists of the graded work specified in the CMS-LM-MOC catalogue.
Credit Points and Grades 15 credit points can be earned by passing the module. The module grade results from the weighted average of the graded work according to the CMS-LM-MOC catalogue.
Frequency of Offer The module is offered in each academic year, starting in the summer semester.
Workload The total workload is 450 hours.
Duration of Module The module takes two semesters to complete.
Module Number Module Handbook TU Dresden CMS-LM-MOC

Registration periods

Phase Block Register from | to End cancellation
Ohne Auswahlverfahren Vorlesungszeit 04.04.2021 00:00 | 15.06.2021 00:00 13.07.2021 00:00

Courses
Number Name Semester  
DK1100-MA002X Dummykurs CMS 2 SWS  
DK1100-MA004X Dummykurs CMS 4 SWS  
DK1100-MA014X Dummykurs CMS 4 SWS  
DK1100-MA016X Dummykurs 6 SWS  
DK1100-MA018X Dummykurs CMS 8 SWS  
DK1100-MA022X Dummykurs CMS 2 SWS  
DK1100-MA024X Dummykurs 4 SWS  
DK1100-MA034X Dummykurs 4 SWS  
K1101-MA0002V Advanced Logics (L)  
K1101-MA0002V Advanced Logics (L) SuSe 2021
K1101-MA0002V Advanced Logics (L) SuSe 2022
K1101-MA0002Ü Advanced Logics (E)  
K1101-MA0002Ü Advanced Logics (E) SuSe 2021
K1101-MA0002Ü Advanced Logics (E) SuSe 2022
K1101-MA0003V Automata and Logic (L)  
K1101-MA0003Ü Automata and Logic (E)  
K1101-MA0007S Rule-Based Paradigms in Knowledge Representation (S)  
K1101-MA0008V Concurrency Theory (L)  
K1101-MA0008Ü Concurrency Theory (Ü)  
K1101-MA0015V Introduction to Automatic Structures (L)  
K1101-MA0015Ü Introduction to Automatic Structures (E)  
K1101-MA0019V Model Checking (L)  
K1101-MA0019Ü Model Checking (E)  
K1101-MA0020Ü Lab Course Modeling and Automated Verification (E)  
K1101-MA0021S Seminar Selected Topics in Logic and Verification (S)  
K1101-MA0021V Foundations of Complexity Theory (L)  
K1101-MA0022V Complexity Theory (V)  
K1101-MA0022Ü Complexity Theory (E)  
K1101-MA0025V Term Rewriting Systems (L)  
K1101-MA0025V Term Rewriting Systems (L) WiSe 2021/22
K1101-MA0025Ü Term Rewriting Systems (E)  
K1101-MA0025Ü Term Rewriting Systems (E) WiSe 2021/22
K1101-MA0030S Seminar Data Aware Processes (S)  
K1101-MA0030S Seminar Data-Aware Processes (S) SuSe 2021
K1107-MA0018V Database Theory (L)  
K1107-MA0018V Database Theory (L) SuSe 2022
K1107-MA0018Ü Database Theory (E)  
K1107-MA0018Ü Database Theory (E) SuSe 2022
K1107-MA0019V Finite and Algorithmic Model Theory (L)  
K1107-MA0019Ü Finite and Algorithmic Model Theory (E)  
K1107-MA0055V Introduction to Formal Concept Analysis (L)  
K1107-MA0055Ü Introduction to Formal Concept Analysis (E)  

Passing rules
Context Name Description
Global * For information on the module examination please see module description
Global * For information on the module examination please see module description

Requirements
Course / Final module requirements Requirements Compulsory pass Weighting
DK1100-MA002X Dummykurs CMS 2 SWS Assessment No 2
DK1100-MA004X Dummykurs CMS 4 SWS Assessment No 4
DK1100-MA014X Dummykurs CMS 4 SWS Assessment No 4
DK1100-MA016X Dummykurs 6 SWS Assessment No 6
DK1100-MA018X Dummykurs 8 SWS Assessment No 8
DK1100-MA022X Dummykurs CMS 2 SWS Assessment No 2
DK1100-MA024X Dummykurs 4 SWS Assessment No 4
DK1100-MA034X Dummykurs 4 SWS Assessment No 4
K1101-MA0002V Advanced Logics (L) Oral Assessment Advanced Logics No 6
K1101-MA0003V Automata and Logic (L) Oral Assessment Automata and Logic No 6
K1101-MA0007S Rule-Based Paradigms in Knowledge Representation (S) Oral Presentation Rule-Based Paradigms in Knowledge Representation No 1
Seminar Paper Rule-Based Paradigms in Knowledge Representation No 1
K1101-MA0008V Concurrency Theory (L) Assessment No 4
K1101-MA0015V Introduction to Automatic Structures (L) Oral Assessment Introduction to Automatic Structures No 4
K1101-MA0019V Model Checking (L) Oral Assessment Model Checking No 8
K1101-MA0020Ü Lab Course Modeling and Automated Verification (E) Project Report Modeling and Automated Verification No 2
K1101-MA0021S Seminar Selected Topics in Logic and Verification (S) Presentation Selected Topics in Logic and Verification No 1
Seminar Paper Selected Topics in Logic and Verification No 1
K1101-MA0021V Foundations of Complexity Theory (L) Oral Assessment Foundations of Complexity Theory No 4
K1101-MA0022V Complexity Theory (L) Oral Assessment Complexity Theory No 6
K1101-MA0025V Term Rewriting Systems (L) Oral Assessment Term Rewriting Systems No 6
K1101-MA0030S Seminar Data-Aware Processes (S) Presentation Data Aware Processes No 1
Seminar Paper Data Aware Processes No 1
K1107-MA0018V Database Theory (L) Oral Assessment Database Theory No 6
K1107-MA0019V Finite and Algorithmic Model Theory (L) Oral Assessment Finite and Algorithmic Model Theory No 4
K1107-MA0055V Introduction to Formal Concept Analysis (L) Oral Assessment Introduction to Formal Concept Analysis No 4

Caption
**

For this final module requirement, several combinations of requirements do exist. The passing rules (see above) specify, whether you have to complete one or several requirement combinations.