goto UNSW home page  
Contacts Library myUNSW WebCT
Algorithmic Verification - COMP4151
PRINT THIS PAGE
Library lawn
 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Course Outline: http://www.cse.unsw.edu.au/
 
 
Campus: Kensington Campus
 
 
Career: Undergraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.125 (more info)
 
 
Contact Hours per Week: 4
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP3151.
 
 
Fee Band: 2 (more info)
 
 
Further Information: See Class Timetable
 
 

Description

This course is an Advanced Topics in Concurrency occasional elective; a change of name is expected each year.
Topics will be chosen from: semantics models of concurrent and distributed systems (e.g. process algebra, event structures, Petri nets, Chu spaces), linear versus branching time, interleaving versus partial order semantics, true concurrency, semantic equivalences, modal and temporal logic for concurrent systems (proof theory and applicants), algorithmic verification (model checking, automa on infinite structures, synthesis), reasoning about knowledge in distributed systems.

Further Information

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.