Parametrized Verification and Synthesis

Adaptive Synchronisation of Pushdown Automata

Auteurs: A. R. Balasubramanian, K. S. Thejaswini
Publié dans: preprint, 2021
Éditeur: none

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results

Auteurs: Jacobs, Swen; Bloem, Roderick; Colange, Maximilien; Faymonville, Peter; Finkbeiner, Bernd; Khalimov, Ayrat; Klein, Felix; Luttenberger, Michael; Meyer, Philipp J.; Michaud, Thibaud; Sakr, Mouhammad; Sickert, Salomon; Tentrup, Leander; Walker, Adam
Publié dans: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), 2019
Éditeur: none
DOI: 10.48550/arxiv.1904.07736

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results

Auteurs: Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr, Salomon Sickert, Leander Tentrup, Adam Walker
Publié dans: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), Numéro Yearly report, 2019
Éditeur: none

Abstraction-Based Segmental Simulation of Chemical Reaction Networks

Auteurs: Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek
Publié dans: Computational Methods in Systems Biology - 20th International Conference, {CMSB} 2022, 2022, Page(s) 41--60, ISBN 978-3-031-15034-0
Éditeur: Springer
DOI: 10.1007/978-3-031-15034-0_3

Fast and Succinct Population Protocols for Presburger Arithmetic

Auteurs: Czerner, Philipp; Guttenberg, Roland; Helfrich, Martin; Esparza, Javier
Publié dans: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Numéro 221, 2022, Page(s) 11:1--11:17, ISBN 978-3-95977-224-2
Éditeur: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.sand.2022.11

Separators in Continuous Petri Nets

Auteurs: Michael Blondin, Javier Esparza
Publié dans: Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, 2022, Page(s) 81--100
Éditeur: Springer
DOI: 10.1007/978-3-030-99253-8_5

Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version)

Auteurs: Balasubramanian, A. R.; Guillou, Lucie; Weil-Kennedy, Chana
Publié dans: FoSSaCS 2022: Foundations of Software Science and Computation Structures, 2022, Page(s) 61–80, ISBN 978-3-030-99253-8
Éditeur: Springer
DOI: 10.1007/978-3-030-99253-8_4

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling

Auteurs: Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera, Philipp J. Meyer
Publié dans: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II, Numéro 12225, 2020, Page(s) 372-397, ISBN 978-3-030-53290-1
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-53291-8_20

Abduction of trap invariants in parameterized systems

Auteurs: Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Publié dans: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, 2021, Page(s) 1--17
Éditeur: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS)
DOI: 10.4204/eptcs.346.1

Geometry of Reachability Sets of Vector Addition Systems

Auteurs: Roland Guttenberg, Mikhail A. Raskin, Javier Esparza
Publié dans: 34th International Conference on Concurrency Theory, CONCUR 2023, 2023
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2023.6

Computing Parameterized Invariants of Parameterized Petri Nets

Auteurs: Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Publié dans: Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS 2021, Numéro 12734, 2021, Page(s) 141--163
Éditeur: Springer
DOI: 10.1007/978-3-030-76983-3_8

Giant Components in Random Temporal Graphs

Auteurs: Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Publié dans: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, 2023
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.approx/random.2023.29

Brief Announcement: Population Protocols Decide Double-exponential Thresholds

Auteurs: Philipp Czerner
Publié dans: 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, 2023
Éditeur: ACM
DOI: 10.1145/3583668.3594571

Coefficient Synthesis for Threshold Automata

Auteurs: Balasubramanian, A.R.
Publié dans: Reachability Problems - 16th International Conference, RP 2022, Numéro 13608, 2022, Page(s) 125--139, ISBN 978-3-031-19135-0
Éditeur: Springer
DOI: 10.1007/978-3-031-19135-0_9

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

Auteurs: A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Publié dans: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Page(s) 1--13
Éditeur: IEEE
DOI: 10.1109/lics52264.2021.9470733

QueryFS: compiling queries to define a filesystem

Auteurs: Raskin, Michael
Publié dans: The 15th European Lisp Symposium (ELS'22), Numéro 3, 2022
Éditeur: Zenodo
DOI: 10.5281/zenodo.6308532

Characterizing Consensus in the Heard-Of Model

Auteurs: A. R. Balasubramanian, Igor Walukiewicz
Publié dans: 31st International Conference on Concurrency Theory, CONCUR 2020, Numéro 171, 2020, Page(s) 9:1--9:18
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.9

A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries

Auteurs: Nathalie Bertrand, Marijana Lazic, Josef Widder
Publié dans: Verification, Model Checking, and Abstract Interpretation, 2021, Page(s) 219--239
Éditeur: Springer
DOI: 10.1007/978-3-030-67067-2_11

Certifying Inexpressibility

Auteurs: Orna Kupferman, Salomon Sickert
Publié dans: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Numéro 12650, 2021, Page(s) 385-405, ISBN 978-3-030-71994-4
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_20

Lower Bounds on the State Complexity of Population Protocols

Auteurs: Philipp Czerner; Javier Esparza
Publié dans: The 2021 ACM Symposium on Principles of Distributed Computing (PODC), Numéro 2, 2021, Page(s) 45--54
Éditeur: Association for Computing Machinery (ACM)
DOI: 10.1145/3465084.3467912

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent

Auteurs: A. R. Balasubramanian; Chana Weil-Kennedy
Publié dans: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Numéro 1, 2021, Page(s) 18--34
Éditeur: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS)
DOI: 10.48550/arxiv.2109.08315

Complexity of Coverability in Depth-Bounded Processes

Auteurs: Balasubramanian, A. R.
Publié dans: 33rd International Conference on Concurrency Theory (CONCUR 2022), Numéro 243, 2022, Page(s) 17:1--17:19, ISBN 978-3-95977-246-4
Éditeur: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2022.17

Tutorial: Parameterized Verification with Byzantine Model Checker

Auteurs: Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder
Publié dans: Formal Techniques for Distributed Objects, Components, and Systems - FORTE 2020, 2020
Éditeur: Springer
DOI: 10.1007/978-3-030-50086-3_11

Flatness and Complexity of Immediate Observation Petri Nets

Auteurs: Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza
Publié dans: 31st International Conference on Concurrency Theory, CONCUR 2020, Numéro 171, 2020, Page(s) 45:1--45:19
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.45

Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs

Auteurs: Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer
Publié dans: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Numéro 12302, 2020, Page(s) 550-556, ISBN 978-3-030-59151-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_32

Affine Extensions of Integer Vector Addition Systems with States

Auteurs: Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail Raskin
Publié dans: 29th International Conference on Concurrency Theory (CONCUR 2018), 2018, Page(s) 14:1--14:17, ISBN 978-3-95977-087-3
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2018.14

Decision Power of Weak Asynchronous Models of Distributed Computing

Auteurs: Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza
Publié dans: PODC, Numéro 13, 2021
Éditeur: ACM
DOI: 10.48550/arxiv.2102.11630

A Simple Rewrite System for the Normalization of Linear Temporal Logic

Auteurs: Javier Esparza, Ruben Rubio, Salomon Sickert
Publié dans: Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, Numéro 13660, 2022, Page(s) 208--227
Éditeur: Springer
DOI: 10.1007/978-3-031-22337-2_10

Verification of Immediate Observation Population Protocols

Auteurs: Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Publié dans: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.31

Automatic Analysis of Expected Termination Time for Population Protocols

Auteurs: Michael Blondin, Javier Esparza, Antonín Kučera
Publié dans: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.33

Parameterized Analysis of Immediate Observation Petri Nets

Auteurs: Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy
Publié dans: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23–28, 2019, Proceedings, Numéro 11522, 2019, Page(s) 365-385, ISBN 978-3-030-21570-5
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-21571-2_20

Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics

Auteurs: Idan Berkovits, Marijana Lazić, Giuliano Losa, Oded Padon, Sharon Shoham
Publié dans: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, Numéro 11562, 2019, Page(s) 245-266, ISBN 978-3-030-25542-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-25543-5_15

Computing the Expected Execution Time of Probabilistic Workflow Nets

Auteurs: Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Publié dans: Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part II, Numéro 11428, 2019, Page(s) 154-171, ISBN 978-3-030-17464-4
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-17465-1_9

Working with first-order proofs and provers

Auteurs: Mikhail Raskin, Christoph Welzel
Publié dans: 12-th European Lisp Symposium (ELS 2019), 2019
Éditeur: ELS
DOI: 10.5281/zenodo.2633990

Expressive Power of Broadcast Consensus Protocols

Auteurs: Michael Blondin, Javier Esparza, Stefan Jaax
Publié dans: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Page(s) 31:1--31:16, ISBN 978-3-95977-121-4
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.31

Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries

Auteurs: Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Publié dans: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Page(s) 33:1--33:15, ISBN 978-3-95977-121-4
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.33

How to Win First-Order Safety Games

Auteurs: Helmut Seidl, Christian Müller, Bernd Finkbeiner
Publié dans: Verification, Model Checking, and Abstract Interpretation - 21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16–21, 2020, Proceedings, Numéro 11990, 2020, Page(s) 426-448, ISBN 978-3-030-39321-2
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-39322-9_20

Succinct Population Protocols for Presburger Arithmetic

Auteurs: Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Publié dans: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Numéro volume 154, 2020, Page(s) 40:1--40:15, ISBN 978-3-95977-140-5
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.40

Wait-Free Solvability of Equality Negation Tasks

Auteurs: Eric Goubault, Marijana Lazic, Jeremy Ledent, Sergio Rajsbaum
Publié dans: 33rd International Symposium on Distributed Computing (DISC 2019), Numéro Volume 146, 2019, Page(s) 21:1--21:16, ISBN 978-3-95977-126-9
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2019.21

A Dynamic Epistemic Logic Analysis of the Equality Negation Task

Auteurs: Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Publié dans: Dynamic Logic. New Trends and Applications - Second International Workshop, DaLí 2019, Porto, Portugal, October 7–11, 2019, Proceedings, Numéro 12005, 2020, Page(s) 53-70, ISBN 978-3-030-38807-2
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-38808-9_4

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

Auteurs: Michael Raskin, Mark Simkin
Publié dans: Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II, Numéro 11922, 2019, Page(s) 537-563, ISBN 978-3-030-34620-1
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-34621-8_19

Population Protocols with Unreliable Communication

Auteurs: Mikhail Raskin
Publié dans: Algorithms for Sensor Systems, ALGOSENSORS 2021, Numéro 12961, 2021, Page(s) 140--154, ISBN 978-3-030-89240-1
Éditeur: Springer
DOI: 10.1007/978-3-030-89240-1_10

On Affine Reachability Problems

Auteurs: Stefan Jaax, Stefan Kiefer
Publié dans: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 2020
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2020.48

Structural Invariants for the Verification of Systems with Parameterized Architectures

Auteurs: Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel
Publié dans: 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, Numéro 12078, 2020, Page(s) 228-246, ISBN 978-3-030-45189-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-45190-5_13

The Complexity of Reachability in Affine Vector Addition Systems with States

Auteurs: Michael Blondin, Mikhail Raskin
Publié dans: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 224-236, ISBN 9781-450371049
Éditeur: ACM
DOI: 10.1145/3373718.3394741

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

Auteurs: Salomon Sickert, Javier Esparza
Publié dans: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 831-844, ISBN 9781-450371049
Éditeur: ACM
DOI: 10.1145/3373718.3394743

Complexity of controlled bad sequences over finite sets of Nd

Auteurs: A. R. Balasubramanian
Publié dans: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 130-140, ISBN 9781-450371049
Éditeur: ACM
DOI: 10.1145/3373718.3394753

Efficient Restrictions of Immediate Observation Petri Nets

Auteurs: Michael Raskin, Chana Weil-Kennedy
Publié dans: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings, Numéro 12448, 2020, Page(s) 99-114, ISBN 978-3-030-61738-7
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-61739-4_7

Making IP = PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms

Auteurs: Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar
Publié dans: 35th International Conference on Computer Aided Verification, CAV 2023, 2023
Éditeur: Springer
DOI: 10.1007/978-3-031-37709-9_21

Running Time Analysis of Broadcast Consensus Protocols

Auteurs: Philipp Czerner, Stefan Jaax
Publié dans: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Numéro 12650, 2021, Page(s) 164-183, ISBN 978-3-030-71994-4
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_9

Practical Applications of the Alternating Cycle Decomposition

Auteurs: Antonio Casares, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert
Publié dans: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, 2022, Page(s) 99--117
Éditeur: Springer
DOI: 10.1007/978-3-030-99527-0_6

Regular Model Checking Upside-Down: An Invariant-Based Approach

Auteurs: Esparza, Javier; Raskin, Mikhail; Welzel, Christoph
Publié dans: 33rd International Conference on Concurrency Theory (CONCUR 2022), Numéro 1, 2022, Page(s) 23:1 -- 23:19, ISBN 978-3-95977-246-4
Éditeur: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2022.23

Complexity of Verification and Synthesis of Threshold Automata

Auteurs: A. R. Balasubramanian, Javier Esparza, Marijana Lazić
Publié dans: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Numéro 12302, 2020, Page(s) 144-160, ISBN 978-3-030-59151-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_8

Holistic Verification of Blockchain Consensus

Auteurs: Bertrand, Nathalie ; Gramoli, Vincent ; Konnov, Igor ; Lazić, Marijana ; Tholoniat, Pierre ; Widder, Josef
Publié dans: 36th International Symposium on Distributed Computing (DISC 2022), Numéro 246, 2022, Page(s) 10:1--10:24, ISBN 978-3-95977-255-6
Éditeur: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2022.10

Complexity of Coverability in Bounded Path Broadcast Networks

Auteurs: Balasubramanian, A. R.
Publié dans: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Numéro 213, 2021, Page(s) 35:1--35:16, ISBN 978-3-95977-215-0
Éditeur: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.fsttcs.2021.35

Lisp in the middle: using Lisp to manage a Linux system

Auteurs: Raskin, Michael
Publié dans: The 14th European Lisp Symposium (ELS'21), Numéro 4, 2021, ISSN 2677-3465
Éditeur: Zenodo
DOI: 10.5281/zenodo.4724166

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

Auteurs: A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
Publié dans: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Numéro 12650, 2021, Page(s) 42-61, ISBN 978-3-030-71994-4
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_3

A Classification of Weak Asynchronous Models of Distributed Computing

Auteurs: Javier Esparza, Fabian Reiter
Publié dans: 31st International Conference on Concurrency Theory, CONCUR 2020, Numéro 171, 2020, Page(s) 10:1--10:16
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.10

Population Protocols: Beyond Runtime Analysis

Auteurs: Esparza, Javier
Publié dans: Reachability Problems - 15th International Conference, RP 2021, 2021, Page(s) 28--51, ISBN 978-3-030-89716-1
Éditeur: Springer
DOI: 10.1007/978-3-030-89716-1_3

Sharp Thresholds in Random Simple Temporal Graphs

Auteurs: Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Publié dans: 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, Page(s) 319-326, ISBN 978-1-6654-2055-6
Éditeur: IEEE
DOI: 10.1109/focs52979.2021.00040

Proving Noninterference in Multi-Agent Systems

Auteurs: Christian Müller
Publié dans: 2020
Éditeur: Technical University of Munich

Efficient Analysis of Population Protocols and Chemical Reaction Networks (under review, will be published under open access by the university library)

Auteurs: Martin Helfrich
Publié dans: 2023
Éditeur: Technical University of Munich

Computational Complexity of the Verification of Parameterized Systems (under review, will be published under open access by the university library)

Auteurs: A.R. Balasubramanian
Publié dans: 2023
Éditeur: Technical University of Munich

Observation Petri Nets

Auteurs: Chana Weil-Kennedy
Publié dans: 2023
Éditeur: Technical University of Munich

Inductive Statements for Regular Transition Systems (under review, will be published under open access by the university library)

Auteurs: Christoph Welzel-Mohr
Publié dans: 2023
Éditeur: Technical University of Munich

Constraint-based Analysis of Distributed Systems

Auteurs: Philipp Klara Johanna Meyer
Publié dans: 2021
Éditeur: Technical University of Munich

Population Protocols: Expressiveness, Succinctness and Automatic Verification

Auteurs: Stefan Jaax
Publié dans: 2020
Éditeur: Technical University of Munich

Regular Model Checking Upside-Down: An Invariant-Based Approach (submitted, under review)

Auteurs: Javier Esparza, Mikhail Raskin, Christoph Welzel
Publié dans: Logical Methods in Computer Science, 2023, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2205.03060

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

Auteurs: Hans van Ditmarsch, Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Publié dans: Journal of Logical and Algebraic Methods in Programming, Numéro 121, 2021, Page(s) 100662, ISSN 2352-2208
Éditeur: Elsevier
DOI: 10.1016/j.jlamp.2021.100662

Parameterized verification of coverability in infinite state broadcast networks

Auteurs: A. R. Balasubramanian
Publié dans: Information and Computation, Numéro Volume 278, 2021, ISSN 0890-5401
Éditeur: Academic Press
DOI: 10.1016/j.ic.2020.104592

A Unified Translation of Linear Temporal Logic to ω-Automata

Auteurs: Javier Esparza, Jan Křetínský, Salomon Sickert
Publié dans: Journal of the ACM, Numéro 67/6, 2020, Page(s) 1-61, ISSN 0004-5411
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3417995

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker

Auteurs: Igor Konnov; Marijana Lazić; Ilina Stoilkovska; Josef Widder
Publié dans: Logical Methods in Computer Science, Numéro Volume 19, Numéro 1, 2023, Page(s) 5:1 -- 5:37, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2011.14789

Lower bounds on the state complexity of population protocols

Auteurs: Philipp Czerner, Javier Esparza, Jérôme Leroux
Publié dans: Distributed Computing, 2023, ISSN 1432-0452
Éditeur: Springer
DOI: 10.1007/s00446-023-00450-4

Computing Parameterized Invariants of Parameterized Petri Nets

Auteurs: Javier Esparza; Mikhail Raskin; Christoph Welzel
Publié dans: Fundamental Informaticae, Numéro 1, 2022, Page(s) 197--243, ISSN 0169-2968
Éditeur: IOS Press
DOI: 10.3233/fi-222137

From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata

Auteurs: Javier Esparza, Jan Křetínský, Jean-François Raskin, Salomon Sickert
Publié dans: International Journal on Software Tools for Technology Transfer, Numéro 24, 2022, Page(s) 635–659, ISSN 1433-2779
Éditeur: Springer Verlag
DOI: 10.1007/s10009-022-00663-1

Efficient Normalization of Linear Temporal Logic (submitted, subject to minor revisions)

Auteurs: Javier Esparza, Rubén Rubio, Salomon Sickert
Publié dans: Journal of the ACM, 2023, ISSN 0004-5411
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.48550/arxiv.2310.12613

Practical synthesis of reactive systems from LTL specifications via parity games

Auteurs: Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
Publié dans: Acta Informatica, 2019, ISSN 0001-5903
Éditeur: Springer Verlag
DOI: 10.1007/s00236-019-00349-3

A Stay-in-a-Set Game without a Stationary Equilibrium

Auteurs: Kristoffer Arnsfelt Hansen, Mikhail Raskin
Publié dans: Electronic Proceedings in Theoretical Computer Science, Numéro 305, 2019, Page(s) 83-90, ISSN 2075-2180
Éditeur: Electronic Proceedings in Theoretical Computer Science
DOI: 10.4204/eptcs.305.6

On defining linear orders by automata

Auteurs: Bruno Courcelle, Irène Durand, Michael Raskin
Publié dans: Moscow Journal of Combinatorics and Number Theory, Numéro 9/3, 2020, Page(s) 253-291, ISSN 2640-7361
Éditeur: Mathematical Sciences Publishers
DOI: 10.2140/moscow.2020.9.253

Affine Extensions of Integer Vector Addition Systems with States

Auteurs: Michael Blondin ; Christoph Haase ; Filip Mazowiecki ; Mikhail Raskin
Publié dans: Logical Methods in Computer Science, Numéro Volume 17, Numéro 3, 2021, Page(s) 1:1–1:26, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:1)2021

Fast and Succinct Population Protocols for Presburger Arithmetic

Auteurs: Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Publié dans: Journal of Computer and System Sciences, 2023, ISSN 0022-0000
Éditeur: Academic Press
DOI: 10.1016/j.jcss.2023.103481

Towards efficient verification of population protocols

Auteurs: Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Publié dans: Formal Methods in System Design, 2021, ISSN 0925-9856
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10703-021-00367-3

Certifying Inexpressibility

Auteurs: Orna Kupferman; Salomon Sickert
Publié dans: Foundations of Software Science and Computation Structures, Numéro 1, 2021, Page(s) 385--405, ISSN 0302-9743
Éditeur: Springer Verlag
DOI: 10.48550/arxiv.2101.08756

The complexity of verifying population protocols

Auteurs: Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy
Publié dans: Distributed Computing, Numéro 34/2, 2021, Page(s) 133-177, ISSN 0178-2770
Éditeur: Springer Verlag
DOI: 10.1007/s00446-021-00390-x

The Complexity of Reachability in Affine Vector Addition Systems with States

Auteurs: Michael Blondin ; Mikhail Raskin
Publié dans: Logical Methods in Computer Science, Numéro Volume 17, Numéro 3, 2021, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:3)2021

Protocols with constant local storage and unreliable communication

Auteurs: Mikhail Raskin
Publié dans: Theoretical Computer Science, Numéro Volume 940, Part A, 2023, Page(s) 269--282, ISSN 0304-3975
Éditeur: Elsevier BV
DOI: 10.1016/j.tcs.2022.11.006

Verification of randomized consensus algorithms under round-rigid adversaries

Auteurs: Nathalie Bertrand, Igor Konnov, Marijana Lazić, Josef Widder
Publié dans: International Journal on Software Tools for Technology Transfer, Numéro 23, 2021, Page(s) 797--821, ISSN 1433-2779
Éditeur: Springer Verlag
DOI: 10.1007/s10009-020-00603-x

Publications

Partager cette page

Télécharger