Download full bibliography (as BibTex): PaVeS publications

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


2019

  • Luttenberger, M., Meyer, P.J., Sickert, S.: Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games. CoRR. abs/1903.12576, (2019)
    synthesis

    (To appear at Acta Informatica)

    URL: Link
    BibTeX EndNote URL
  • Berkovits, I., Lazic, M., Losa, G., Padon, O., Shoham, S.: Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. CoRR. abs/1905.07805, (2019)
    distributedalgorithms

    (To appear at CAV 2019)

    URL: Link
    BibTeX EndNote URL
  • Blondin, M., Esparza, J., Jaax, S.: Expressive Power of Broadcast Consensus Protocols. In: Fokkink, W. and van Glabbeek, R. (eds.) The 30th International Conference on Concurrency Theory Amsterdam, the Netherlands, August 26-31, 2019 (2019)
    broadcast complexity protocols,
    BibTeX EndNote URL
  • Desel, J., Esparza, J., Hoffmann, P.: Negotiation as concurrency primitive. Acta Inf. 56, 93-159 (2019)
    distributedalgorithms

    URL: Link
    BibTeX EndNote URL
  • Esparza, J.: Coffee and Cigarettes. In: Reisig, W. and Rozenberg, G. (eds.) Carl Adam Petri: Ideas, Personality, Impact. pp. 97-103. Springer (2019)
    petrinets

    URL: Link
    BibTeX EndNote URL
  • Raskin, M.: Population protocols with unreliable communication. CoRR. abs/1902.10041, (2019)
    broadcastprotocols faulttolerance populationprotocols

    URL: Link
    BibTeX EndNote URL
  • Raskin, M., Welzel, C.: Working with first-order proofs and provers. European Lisp Symposium (2019)
    automatedtheoremprovers firstorderlogic interactiveproofsystems

    URL: Link
    BibTeX EndNote URL
  • Meyer, P.J., Esparza, J., Offtermatt, P.: Computing the Expected Execution Time of Probabilistic Workflow Nets. In: Vojnar, T. and Zhang, L. (eds.) TACAS (2). pp. 154-171. Springer (2019)
    expectedterminationtime petrinets

    URL: Link
    BibTeX EndNote URL
  • Blondin, M., Esparza, J., Jaax, S.: Expressive Power of Oblivious Consensus Protocols, http://arxiv.org/abs/1902.01668, (2019)
    broadcast population protocols protocols,

    (cite arxiv:1902.01668)

    URL: Link
    Abstract BibTeX EndNote URL
  • Esparza, J., Raskin, M., Weil-Kennedy, C.: Parameterized Analysis of Immediate Observation Petri Nets. In: Donatelli, S. and Haar, S. (eds.) Petri Nets. pp. 365-385. Springer (2019)
    immediateobservation populationprotocols

    URL: Link
    BibTeX EndNote URL
  • Jaax, S., Kiefer, S.: On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices. CoRR. abs/1905.05114, (2019)
    groups matrix reachability, semi

    URL: Link
    BibTeX EndNote URL

2018

  • Bertrand, N., Konnov, I., Lazic, M., Widder, J.: Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries. HAL. hal-01925533, (2018)
    ParametrizedVerification distributedalgorithms

    (To appear at CONCUR 2019)

    URL: Link
    BibTeX EndNote URL
  • Blondin, M., Esparza, J., Kucera, A.: Automatic 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
    Abstract BibTeX EndNote URL
  • Esparza, J., Ganty, P., Majumdar, R., Weil-Kennedy, C.: Verification 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
    Abstract BibTeX EndNote Download URL