Download full bibliography (as BibTex): PaVeS publications

Our previous work in the field of parametrized synthesis and verification: previous work

### 2021

- Abstract BibTeX EndNote URLA Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. In: Henglein, F., Shoham, S., and Vizel, Y. (eds.) Verification, Model Checking, and Abstract Interpretation. p. 219--239. Springer International Publishing (2021)

distributedalgorithms

URL: Link

### 2020

- Abstract BibTeX EndNote URLCharacterizing Consensus in the Heard-Of Model. In: Konnov, I. and Kovács, L. (eds.) 31st International Conference on Concurrency Theory (CONCUR 2020). p. 9:1--9:18. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020)

HeardOfmodel consensusproblem myown verification

URL: Link

Preprint: Link - Abstract BibTeX EndNote URLAn Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. pp. 831–844. Association for Computing Machinery, Saarbrücken, Germany (2020)

AlternatingAutomata DeterministicForm LinearLogic Normal Temporal Weak

URL: Link

Preprint: Link - Abstract BibTeX EndNote URLA Classification of Weak Asynchronous Models of Distributed Computing. In: Konnov, I. and Kovács, L. (eds.) 31st International Conference on Concurrency Theory (CONCUR 2020). p. 10:1--10:16. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020)

asyncronous classification distributedalgorithms myown

URL: Link

Preprint: Link - Abstract BibTeX EndNote URLStructural Invariants for the Verification of Systems with Parameterized Architectures. In: Biere, A. and Parker, D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part I. p. 228--246. Springer (2020)

invariants myown parameterizedverification verification

URL: Link

Preprint: Link - BibTeX EndNote URLParameterized Complexity of Safety of Threshold Automata. In: Saxena, N. and Simon, S. (eds.) 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). p. 37:1--37:15. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020)

complexity parametrized thresholdautomata

URL: Link

### 2019

- Abstract BibTeX EndNote URLExpressive Power of Broadcast Consensus Protocols. In: Fokkink, W. and van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory (CONCUR 2019). p. 31:1--31:16. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)

broadcast complexity protocols

URL: Link

Preprint: Link - Abstract BibTeX EndNote URLVerification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. In: Dillig, I. and Tasiran, S. (eds.) Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II. p. 245--266. Springer (2019)

distributedalgorithms myown parameterizedverification

URL: Link - Abstract BibTeX EndNote URLVerification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. In: Fokkink, W. and van Glabbeek, R. (eds.) CONCUR. pp. 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)

distributedalgorithms myown parametrizedverification randomizedconsensus

URL: Link

Preprint: Link

### 2018

- Abstract BibTeX EndNote URLAutomatic Analysis of Expected Termination Time for Population Protocols. In: Schewe, S. and Zhang, L. (eds.) 29th International Conference on Concurrency Theory (CONCUR 2018). pp. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

ExpectedTerminationTime PerformanceAnalysis PopulationProtocols

URL: Link

Preprint: Link - Abstract BibTeX EndNote URLVerification of Immediate Observation Population Protocols. In: Schewe, S. and Zhang, L. (eds.) 29th International Conference on Concurrency Theory (CONCUR 2018). pp. 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

ImmediateObservation ParametrizedVerification PopulationProtocols

URL: Link

Preprint: Link