Round-Bounded Control of Parameterized Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Round-Bounded Control of Parameterized Systems

Abstract

We consider systems with unboundedly many processes that communicate through shared memory. In that context, simple verification questions have a high complexity or, in the case of pushdown processes , are even undecidable. Good algorithmic properties are recovered under round-bounded verification, which restricts the system behavior to a bounded number of round-robin schedules. In this paper, we extend this approach to a game-based setting. This allows one to solve synthesis and control problems and constitutes a further step towards a theory of languages over infinite alphabets.
Fichier principal
Vignette du fichier
atva-2018.pdf (498.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01849206 , version 1 (11-03-2019)

Identifiers

Cite

Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder. Round-Bounded Control of Parameterized Systems. 16th International Symposium on Automated Technology for Verification and Analysis (ATVA 2018), Oct 2018, Los Angeles, California, United States. pp.370-386, ⟨10.1007/978-3-030-01090-4_22⟩. ⟨hal-01849206⟩
298 View
101 Download

Altmetric

Share

Gmail Facebook X LinkedIn More