Selected publications at LSV

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.

   address = {Los Angeles, California, USA},
   author = {Benedikt Bollig and Mathieu Lehaut and Nathalie Sznajder},
   booktitle = {{P}roceedings of the 16th {I}nternational {S}ymposium on {A}utomated {T}echnology for {V}erification and {A}nalysis ({ATVA}'18)},
   editor = {Shuvendu Lahiri and Chao Wang},
   month = oct,
   note = {To appear},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Round-Bounded Control of Parameterized Systems},
   year = {2018},

About LSV

Select by Year