 |
Free and accessible knowledge |
Conference papers
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.
Cited literature [46 references]
https://hal.archives-ouvertes.fr/hal-01849206
Contributor : Benedikt Bollig Connect in order to contact the contributor
Submitted on : Monday, March 11, 2019 - 10:47:56 AM
Last modification on : Tuesday, January 4, 2022 - 3:55:37 AM
Long-term archiving on: : Wednesday, June 12, 2019 - 1:35:20 PM
Contributor : Benedikt Bollig Connect in order to contact the contributor
Submitted on : Monday, March 11, 2019 - 10:47:56 AM
Last modification on : Tuesday, January 4, 2022 - 3:55:37 AM
Long-term archiving on: : Wednesday, June 12, 2019 - 1:35:20 PM
File
atva-2018.pdf
Files produced by the author(s)