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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01849206
Contributor : Benedikt Bollig <>
Submitted on : Monday, March 11, 2019 - 10:47:56 AM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM
Long-term archiving on : Wednesday, June 12, 2019 - 1:35:20 PM

File

atva-2018.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01849206, version 1

Citation

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. ⟨hal-01849206⟩

Share

Metrics

Record views

241

Files downloads

42