CS405 - Introduction to Empirical Modelling 2005/6
Term 1, weeks 1-10:
- Tuesday 9am in CS101
- Wednesday 11am in CS101
- Friday 9am in CS001 (the IBM Lab), for a 2 hour lab session
- See the 2005/6 lecture content for an overview of what was covered.
- See the 2005/6 handout list for an overview of what was distributed.
- See the 2005/6 revision guidance + more notes from WMB (in 2005) available from SBR's office
Remember the module forum
The current CS405 page can be found here.
Note that Lectures 5 and 9 were giving details of the Coursework and one lecture (8th Nov)
between lecture 11 and 12 was cancelled.
Handouts of PowerPoint slides can be found below:
- Prologue: Experience and Computation.
- Lecture 1: Empirical Modelling for Concurrent Systems
- Lecture 2: An Introduction to Empirical Modelling
- Lecture 3: Definitive Notations and Modelling with Definitive Scripts
- Lecture 4: Modelling with Definitive Scripts
- Lecture 12: Human Computing
- Lecture 13: Education and Learning
- Lecture 13: Construal Slides
- Lecture 14: Systems development and EM
Papers and Handouts
- By way of Orientation... (distributed in lecture 0)
- Redressing the past: liberating computing as an experimental science (distributed in lecture 0)
- Is Computing an Experimental Science? by Robin Milner (distributed in lecture 1)
- A perspective on Concurrent Systems (distributed in lecture 6)
- The LSD Notation for Agent Specification (distributed in lecture 7) - formally MSc lecture T2
- LSD Specification for a train arrival-departure protocol (distributed in lecture 7)
- Empirical Modelling for the single agent (distributed in lecture 8)
- Appendix for Empirical Modelling for the single agent (distributed in lecture 8)
- Concurrent Systems Modelling: Agentification, Artefacts, Animation (distributed in lecture 10)
- The Abstract Definitive Machine - formally MSc lecture Th1 (distributed in lecture 11)
- LSD Specification for a train arrival-departure protocol (redistributed in lecture 11, see lecture 7)
- ADM version of the Train Arrival-Departure Protocol (distributed in lecture 11)
- Printout of ADM - the Abstract Definitive Machine [web] (distributed in lecture 11)
- Heapsort handout (distributed in lecture 13)
- Lab 1 - Getting started with tkeden [lab sheet (postscript)] [reference material]
- Lab 2 - Repairing the lift [lab sheet (postscript)]
- Lab 3 - The SCOUT windowing notation [lab sheet (postscript)] [reference material]
- Lab 4 - Line drawing and animation with DoNaLD [lab sheet (postscript)]
- Lab 5 - A showcase of models [information sheet (PDF)]
- Lab 6 - Notations and Parsing [lab sheet (postscript)]
- Lab 7 - Graphical Representation of Dependencies [lab sheet (postscript)]
- Lab 8 - drawSlide - a drag-drop aid for the creation of Scout windows [lab sheet (postscript)]
- Lab 9 - Demonstration of the distributed Clayton tunnel accident model (no lab sheet).
- The module forum
- The Jugs Presentation Model - as shown in lecture 1
- See the guide to the mark schemes for the model and paper.
- A sample 'good' answer for Qu.1 of the 2005 examination (given out in revision lecture).
- Notes on exercising the railwayYung1995 model