Course details of CS 735 - Formal Models for Concurrent and Asynchronous Systems

Course Name Formal Models for Concurrent and Asynchronous Systems
Total Credits 6
Type T
Lecture 3
Tutorial 0
Practical 0
Selfstudy 0
Half Semester N
Prerequisite
Text Reference Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies by W Reisig, Springer, 2013. Petri Nets: Properties, Analysis and Applications, Invited tutorial-survey paper by T Murata, Proceedings of IEEE, Vol 77, No.4, 1988. Automata on Distributed Alphabets: M Mukund, Modern Applications of Automata Theory, Deepak D`Souza and Priti Shankar (editors), IISc Research Monographs Series: Volume 2, World Scientific, pp. 45-78, 2012. Formal Models of Communicating Systems: Languages, Automata, and Monadic Second-Order Logic by B Bollig, Springer, 2006. Well-structured transition systems everywhere! Alain Finkel and Philippe Schnoebelen, Theoretical Computer Science 256(1-2), Elsevier, pp. 63-92, 2001.
Description 1.Petri nets Modeling and analyzing asynchronous systems using Petri nets. Decision problems related to reachability, coverability, etc. for different variants of Petri nets. Other verification related issues. Tools, implementations and case-studies. 2. Asynchronous automata and Zielonka`s theorem. - partial orders, traces, diamond closure, optimal constructions. 3. Message passing automata and message sequence charts Models for scenario based modeling of concurrent and message passing systems. 4. Lossy channel systems and generalization to the theory of well-structured transition systems. Properties of well-quasi orders, well-structured transition systems and decidability issues. Relation to Petri nets and other examples.
Last Update 07-01-2014 16:10:50.300986