Course Description and Learning Outcomes
This is a mandatory course taught in the first year, first semester of the Master in Computer Science (all streams/majors) at the University of Antwerp.
The UA course description can be found here.
The course is taught in English.
This course will introduce you to the different kinds of complexity we have to deal with when designing
large softwareintensive systems. This complexity will be tackled using different modelling formalisms, each appropriate
for specific problems/aspects: various UML diagrams, Causal Block Diagrams (aka Synchronous Data Flow),
Petri Nets, Statecharts, Event Scheduling/Activity Scanning/Process Interaction DiscreteEvent, DEVS, Forrester System Dynamics.
Control Theory will also be briefly introduced with focus on the development of an optimal (embedded, software) controller.
The goal of the course is to gain understanding of the similarities and differences between different formalisms.
Modelling formalisms vary in the level of detail in which they consider time (e.g., partial order, discretetime, continuoustime),
whether they allow modelling of sequential or concurrent behaviour, whether they are deterministic (mostly suited for system/software synthesis)
or nondeterministic (mostly suited for modelling system environment effects, with subsequent safety analysis), whether they support
a notion of spatial distribution, ...
At the end of the course, you should be able to choose between (and explain why) and use appropriate formalisms for
modelling, analysis, simulation and synthesis of diverse (softwareintensive) applications.
The above forms a starting point for more advanced topics. In particular, the combination of different formalisms and the development
of DomainSpecific Modelling Languages. The latter is one of the topics of the course
Model Driven Engineering.

Assessment Methods and Criteria
The course grades are distributed as follows:
 25% on the theory exam;
 75% on the assignments.
To pass the course, you need to attend/submit and orally defend every part (theory exam and each and every
assignment) of the course.
If not, your grade will be "AFW"  absent.
If you do attend/submit every part, you still need an overall score of 50% to pass the course.
Additionally, if for at least one part (theory exam, or any assignment) your score is strictly below 40%,
your overall grade will be min(7, your_score).
your_score is the score you would get when applying the weights given above.
The (written) theory exam takes place during the exam period (see SiSa).
Use of your notes or other materials such as laptops is not allowed (aka "closed book" exam).
Here is a tentative list of Exam Topics/Questions
For the (September) supplemental exam period, partial exemptions for specific parts of the course may
be given. This is discussed individually. You should request exemptions yourself by email to the course lecturer.

Prerequisites
ObjectOriented programming. The course assumes that you master ObjectOriented concepts and are able to understand and produce
ObjectOriented code.
The first couple of assignments make extensive use of the objectoriented programming language Python.
We advise you to prepare for this course by learning the language, if you don't already know it.
A useful tutorial can be found at: http://docs.python.org/tutorial/

Basics of ObjectOriented design (notions of design patterns) and basics of the Unified Modelling Language (UML).
As a refresher, a short introduction will be given on OO Design and UML during one of the first lectures.
The first assignment will test your knowledge on this topic and will demonstrate the relationship between the different
languages in the UML family of languages.

Schedule (currently still last year's schedule, gets updated as the semester progresses)
Week  Date  Type  Room  Subject 
1  Wednesday 28 September 10:45  12:45  Theory  M.G.015  Course introduction: goals, structure, evaluation, planning, Python! Causes of complexity, Software Intensive Systems 
1  Thursday 29 September 10:45  12:45    Academic opening and Studay  no class 
2  Wednesday 5 October 10:45  12:45  Theory  M.G.015  UML notations: Class Diagrams, Sequence Diagrams, Regular Expressions, FSA 
2   Assignment  M.G.015  UML notations  assignment #1 
2  Thursday 6 October 10:45  12:45  Theory  M.G.004  The structure of modelling languages
Algebraic Causal Block Diagrams (denotational) 
3  Wednesday 12 October 10:45  12:45  Theory  M.G.015  Algebraic Causal Block Diagrams (operational), loop detection and solving 
3  Thursday 13 October 10:45  12:45  Theory  M.G.004  DiscreteTime Causal Block Diagrams 
3   Assignment  M.G.004  Alg+DT CBD  assignment #2 
4  Wednesday 19 October 10:45  12:45  Theory  M.G.015  ContinuousTime Causal Block Diagrams 
4  Thursday 20 October 10:45  12:45  Assignment  M.G.004  PID controllers; CT CBD  assignment #3 
3  Thursday 26 October  Deadline   Assignment 1: Requirements Checking 
5  Wednesday 25 October 10:45  12:45  Theory  M.G.015  Finite State Automata; Petri Nets 
5  Thursday 26 October 10:45  12:45  Theory  M.G.004  Petri nets, the tool pipe2 
5   Assignment  M.G.004  Petri nets  assignment #4 
5  Tuesday 31 October  Deadline   Assignment 2: Algebraic and DiscreteTime CBDs 
6  Wednesday 1 November    All Saints day  no class 
6  Thursday 2 November 10:45  12:45    All Souls day  no class 
Lectures
The theory exam will cover the highlighted papers/presentations below.
Blackboard scribbles [pdf]. 
Overview
Modelling and Simulation to Tackle Complexity
Formalisms: Use Cases, Sequence Diagrams, Regular Expressions and Finite State Automata
presentation [pdf] discussing these formalisms in the context of checking the requirements of a system. 
Formalisms: Causal Block Diagrams (CBDs)
Analog computers and CSMP [pdf] 
CSMP: Robert D. Brennan: Digital simulation for control system design. DAC. New
Orleans, Louisiana, USA, May 1619, 1966.
[pdf] 
(old) Blackboard Scribbles. 
Topological Sorting
and Strong Component algorithms. 
Lecture on Algebraic and DiscreteTime CBDs
[video]. 
Lecture on ContinuousTime CBDs
[video]. 
Note: the above are not recordings of
this year's class, but rather of an older version of the course, with the same content however. 
Lecture on (PID) controllers
[pdf] 
Formalisms: Petri Nets
presentation[pdf] 
Christos G. Cassandras.
Discrete Event Systems. Irwin, 1993.
Chapters 4, 5.
[pdf (MoSIS access only)].

Carl Adam Petri. Kommunikation mit Automaten.
1962. (this is Petri's doctoral dissertation).

Tadao Murata.
Petri nets: Properties, analysis and applications.
Proceedings of the IEEE, 77(4):541580, April 1989. 
James L. Peterson.
Petri Net Theory and the Modeling of Systems.
Prentice Hall, 1981. 
Formalisms: Statecharts
Higraphs presentation[pdf].
Statecharts presentation[pdf]. 
David Harel.
Statecharts: A Visual Formalism for Complex Systems.
Science of Computer Programming. Volume 8. 1987. pp. 231  274.
[pdf]. 
David Harel.
On Visual Formalisms.
Communications of the ACM. Volume 31, No. 5. 1988. pp. 514  530.
[pdf]
[pdf (MoSIS access only)]. 
David Harel and Amnon Naamad,
The STATEMATE semantics of statecharts.
ACM Transactions on Software Engineering and Methodology (TOSEM) Volume 5 , Issue 4 (October 1996)
pp.293  333.
[pdf]
[pdf (MoSIS access only)]. 
D. Harel and M. Politi.
Modeling Reactive Systems with Statecharts: The STATEMATE Approach. McGrawHill, 1998.
(available online). 
David Harel and Hillel Kugler.
The Rhapsody Semantics of Statecharts (or, On the Executable Core of the UML).
Springer, Lecture Notes in Computer Science 3147. 2004. pp. 325  354.
[pdf]

Michael von der Beeck. A structured operational semantics for UMLstatecharts.
Software and Systems Modeling. Volume 1, No. 2 pp.130  141. December 2002.
[pdf]. 
The digital watch assignment (not an assignment this year). 
Formalisms: DiscreteEvent World Views; PseudoRandom Number Generators; Gathering Statistics
Formalisms: DiscreteEVent System Specification (DEVS)
(scaled) Real Time Simulation/Execution
Modelling and Simulation Foundations: Systems Specification
presentation [pdf] 
notes [pdf] 
Formalisms: (Forrester) System Dynamics
Formalisms: Hybrid DAE (Modelica)
Modelling Complex Engineered Systems in Industry with Matlab/Simulink
(by Dr. Pieter Mosterman of The Mathworks, Natick, MA)
Assignments (note: currenly still last year's assignments!)
The weight of each assignment is given between [square brackets] as a percentage of the total grade.
The combined assignments count for 75% of the course grade.
