Lecture notes on "Decidable problems on counter systems", ESSLLI'10
Résumé
This document contains a revised version of lecture notes for the advanced course ``Decidable problems for counter systems'' that has been delivered during ESSLLI'2010, Copenhagen, August 2010. A similar course (level M2) has been given at Département d'Informatique de l'Institut Galilée (Université Paris-Nord) for the master ``Mod\'elisation Informatique des Connaissances et du Raisonnement'' (MICR), 2009/2010 and for the master MPRI, course 2.9, 2010/2011. I would like to thank Alain Finkel, Valentin Goranko, Arnaud Sangnier and Marc Zeitoun for their suggestions and remarks about a preliminary version of this document. I wish also to thank the attendees of the ESSLLI course and the master students for their questions, remarks and suggestions that helped me to improve the slides and the current version of the notes.
Mots clés
- repeated reachability
- freeze quantifier
- satisfiability problem
- model-checking
- semilinear set
- reversal-boundedness
- first-order logic
- data word
- undecidability
- complexity
- reachability problem
- boundedness problem
- covering problem
- vector addition system with states (VASS)
- linear-time temporal logic LTL
- temporal logic
- Presburger arithmetic
- Minsky machine
- counter machine
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |