@article{Bollig:2023aa,
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.},
Author = {Bollig, Benedikt and Lehaut, Mathieu and Sznajder, Nathalie},
Date = {2023/07/07},
File = {Round- and context-bounded control of dynamic pushdown systems - s10703-023-00431-0.pdf},
ISBN = {1572-8102},
Journal = {Formal Methods in System Design},
Title = {Round- and context-bounded control of dynamic pushdown systems},
URL = {https://doi.org/10.1007/s10703-023-00431-0},
Year = {2023},
bdsk-url-1 = {https://doi.org/10.1007/s10703-023-00431-0},
date-added = {2023-07-13 14:32:37 +0200},
date-modified = {2023-07-13 14:32:37 +0200},
id = {Bollig2023},
doi = {10.1007/s10703-023-00431-0}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A