Systems Theory

Lecturer:

Petr Moos (gar.)

Tutor:

Petr Moos (gar.), Zdeněk Lokaj

Supervisor:

Department of Computer Science

Synopsis:

Students gain knowledge needed for handling complex, incompletely known or imprecisely described systems of all kinds (software, hardware, controlled physical processes, etc.)

Requirements:

Basics of graph theory, mathematical analysis and algebra.

Syllabus of lectures:

1. System definition. Structural and functional concept of a system.

2. Compositional and dynamic systems. Hard and soft systems.

3. Identification of a system.

4. Structural tasks of the system analysis. Paths and feedbacks.

5. Tasks of decomposition and composition of a system and tasks of system goals.

6. System behavior, behavior models, the notion of a process.

7. Formalisms for the analysis of model behavior: Petri nets, decision tables.

8. Bulk analysis and other methods of system analysis.

9. Soft systems, methods of their analysis.

10. Selected methodologies of system design, the SSADM method.

11. System synthesis with discrete time.

12. Decision and decision processes.

13. Information in a system and in its neighborhood, system regularity, system viability.

Syllabus of tutorials:

Study Objective:

We are surrounded by phenomena and things that are too complex to be completely and in detail described, understood, and analyzed. However, it turns out that many of them, even though of various nature, show similar properties and behaviors: for example, the number of wolfs hunted down in Canada has similar time characteristics as the oscillations of an electronic relaxation oscillator. The structure of a system, i.e., the way how it is assembled from components, often plays substantial role. Students learn to work with these general rules of law both for the analysis of behavior of such systems and for their construction.

Study materials:

1. Bertalanffy, L.v., ''General system theory: foundations, development, applications''. Brazillier, 2003. ISBN 0807604534.

2. Hinrichsen, D., Pritchard, A. J., ''Mathematical systems theory I: modelling, state space analysis, stability''. Springer, 2005. ISBN 3540441255.

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Computer Security, Presented in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• Design of Digital Systems, Presented in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• Computer Security, Presented in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• System Programming, in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• Computer Science, Presented in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• Information Systems and Management, in English, Version for Students, Succeeding in 2010 and 2011 (compulsory course in the program)
• Software Engineering, Presented in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• Web Engineering, Presented in English, Version for Students, who Enrolled in 2010 and 2011 (compulsory course in the program)
• Knowledge Engineering, Presented in English, Version for Students, Succeeding in 2010 and 2011 (compulsory course in the program)
• Master Informatics, Presented in English - Version for Students who Enrolled in 2010 (compulsory course in the program)