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.
CITATION STYLE
Bollig, B., Lehaut, M., & Sznajder, N. (2018). Round-Bounded Control of Parameterized Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11138 LNCS, pp. 370–386). Springer Verlag. https://doi.org/10.1007/978-3-030-01090-4_22
Mendeley helps you to discover research relevant for your work.