Difference between revisions of "Lat22"

Latest revision as of 10:36, 28 April 2022

Logic and Automata Theory

Lecturer: Radu Iosif

Objectives: Many major hardware (Intel, IBM) and software (Microsoft) companies are now using the technique of Model Checking in practice. Examples of its use include the verification of VLSI circuits, communication protocols, software device drivers, real-time embedded systems, and security algorithms. Model checking and verification of computer systems are grounded in the seminal works of A. Pnueli, E. Clarke, E.A Emerson and J. Sifakis, which have been awarded the 1996 and 2007 Turing awards. The basis of these works is the relation of logic with automata theory, which was introduced by Büchi (1960) and Rabin (1969). The goal of this course is to introduce the student to these techniques, focusing on decision methods for classical non-interpreted logics and integer arithmetic theories.

Syllabus:

• Classical first- and second-order logic, finite word and tree automata, closure properties and language emptiness.
• Relationship between Weak Monadic Second-Order Logic and finite automata.
• Infinite automata on words (Buechi, Muller) and on trees (Rabin) automata, and their relationship with Monadic Second-Order Logic.
• Game theory. Proof of Rabin's Complementation Theorem. Application of game theory to logic.

Prerequisites: basic notions of boolean logic and discrete mathematics (sets, relations, orders, functions)

Level: PhD and Master 1-2

Schedule: Wednesdays between 14h00 and 17h00 (Paris time, GMT+1), from March 2nd to April 20th

Location: https://bans.imag.fr/b/rad-dmn-cap-sd6 (BigBlueButton virtual meeting). Here are some guidelines for online participation.

Course material

• March 2: slides video
• March 9: slides video
• March 16: slides video
• March 23: slides video
• March 30: slides video
• April 6: slides video
• April 13: slides video
• April 27: slides video

Additional material

• Equivalence of first-order and star-free languages: First-order definable languages by Volker Diekert and Paul Gastin, pp 1--10
• Equivalence of star-free and aperiodic languages aka Schutzenberger's theorem: slides
• Wolfgang Thomas. Finite Automata and the Infinite 2014 Milner Lecture University of Edinburgh's Informatics Forum
• Textbook proof of McNaughton Theorem
• Proof of Buechi Complementation Theorem using Ramseyan factorizations
• M. Vardi. From Philosophical to Industrial Logics slides
• M. Vardi and P. Wolper. Reasoning about Infinite Computations
• Talks by M. Vardi: And Logic Begat Computer Science: When Giants Roamed the Earth, The Rise and Fall of Linear Temporal Logic
• W. Thomas. Automata on Infinite Objects

Bibliography

• B. Khoussainov and A. Nerode. Automata Theory and its Applications.
• S. Eilenberg. Automata, Languages, and Machines.
• H. Comon, M. Dauchet, R. Gilleron, C. Loeding, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi. Tree Automata: Theory and Applications

Software

• GOAL example
• MONA example

Past LAT courses