Presentation by me of "Fault Diagnosis for Timed Automata" by Stavros Tripakis.
Presentation by me of "Principles and Methods of Testing Finite State Machines - A Survey" by David Lee and Mihalis Yannakakis.
We (me, Egle and our supervisor Gerd) analysed the radar memory interface manufactured by Terma and prepared the model for it to be verified by Uppaal. The supporting material can be found here:
Special thanks to our co-supervisor Thomas Hune, who provided the details of Terma's radar memory interface.
1 the original configuration
contains 8 times bigger buffers, but the verification results does not
differ much.
2 caution: you might need over 105GB
of machine memory to verify the actual case.
We had a Programming Paradigms course which consisted of two subjects: functional programming (Scheme, LAML) and logical programming (SWI Prolog). We successfully defended a mini-project NIM game. The task is explained in appendix A and the result (SWI Prolog program) is in appendix B.
We did a semester project for this course. The project was about autonomous intelligent agents walking in the fields and gathering information from points structured in a grid. Our task was to design a route planning algorithm for them, which actually is a Traveling Salesman Problem and belongs to exponential complexity class of problems (NP problem).
Nothing very special to look at, but colleagues may find interesting to read a report (it contains 37 nice illustrations :-). The appended floppy contains the Simulator application on Java 1.3.1 platform. Only our source code is included.
Last updated at |