Automata and Logics for Concurrent Systems: Realizability and Verification

Benedikt Bollig 1, 2
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : Automata are a popular tool to make computer systems accessible to formal methods. While classical finite automata are suitable to model sequential boolean programs, models of concurrent systems involve several interacting processes and extend finite-state machines in various respects. This habilitation thesis surveys several such extensions, including pushdown automata with multiple stacks, communicating automata with fixed, parameterized, or dynamic communication topology, and automata running on words over infinite alphabets. We focus on two major questions of classical automata theory, namely realizability (asking whether a specification has an automata counterpart) and model checking (asking whether a given automaton satisfies its specification).
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

Cited literature [157 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/tel-01242861
Contributor : Benedikt Bollig <>
Submitted on : Monday, December 14, 2015 - 11:08:27 AM
Last modification on : Thursday, January 11, 2018 - 6:23:37 AM
Long-term archiving on : Saturday, April 29, 2017 - 12:43:37 PM

Identifiers

  • HAL Id : tel-01242861, version 1

Citation

Benedikt Bollig. Automata and Logics for Concurrent Systems: Realizability and Verification. Formal Languages and Automata Theory [cs.FL]. ENS Cachan, 2015. ⟨tel-01242861⟩

Share

Metrics

Record views

326

Files downloads

191