From Numerical Transition Systems
Revision as of 10:30, 26 February 2021 by Radu iosif (Talk | contribs)

Jump to: navigation, search

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.


  • 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, Mueller) 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, from March 3rd to April 21st

Location: (BigBlueButton virtual meeting). Here are some guidelines for online participation.


  • send email to indicating your name and year of Phd/Master program
  • for PhD students, indicate also your host laboratory and name of your PhD advisor

Past LAT courses