Automata and Logics for Concurrent Systems: Realizability and Verification - TEL - Thèses en ligne Access content directly
Habilitation À Diriger Des Recherches Year : 2015

Automata and Logics for Concurrent Systems: Realizability and Verification

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).
Fichier principal
Vignette du fichier
hdr-bollig.pdf (5.69 Mo) Télécharger le fichier
Loading...

Dates and versions

tel-01242861 , version 1 (14-12-2015)

Identifiers

  • HAL Id : tel-01242861 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More