Parameterized Communicating Automata: Complementation and Model Checking

Benedikt Bollig 1, 2 Paul Gastin 1, 2 Akshay Kumar 3
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 : We study the language-theoretical aspects of parameterized communicating automata (PCAs), in which processes communicate via rendez-vous. A given PCA can be run on any topology of bounded degree such as pipelines, rings, ranked trees, bus topologies, and grids. We show that, under a context bound, which restricts the local behavior of each process, PCAs are effectively complementable. Complementability is considered a key aspect of robust automata models and can, in particular, be exploited for verification. In this paper, we use it to obtain a characterization of context-bounded PCAs in terms of monadic second-order (MSO) logic. As the emptiness problem for context-bounded PCAs is decidable for the classes of pipelines, rings, and trees, their model-checking problem wrt. MSO properties also becomes decidable. While previous work on model checking parameterized systems typically uses temporal logics without next operator, our MSO logic allows one to express several natural next modalities.
Type de document :
Communication dans un congrès
34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), Dec 2014, New Delhi, India
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01030765
Contributeur : Benedikt Bollig <>
Soumis le : mardi 22 juillet 2014 - 13:47:37
Dernière modification le : dimanche 22 juillet 2018 - 09:10:03
Document(s) archivé(s) le : mardi 25 novembre 2014 - 11:05:44

Fichier

complementation.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01030765, version 1

Collections

Citation

Benedikt Bollig, Paul Gastin, Akshay Kumar. Parameterized Communicating Automata: Complementation and Model Checking. 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), Dec 2014, New Delhi, India. 〈hal-01030765〉

Partager

Métriques

Consultations de la notice

939

Téléchargements de fichiers

300