Publications Other (7) Adaptive Synchronisation of Pushdown Automata Author(s): A. R. Balasubramanian, K. S. Thejaswini Published in: preprint, 2021 Publisher: none The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results Author(s): 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 Published in: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), 2019 Publisher: none DOI: 10.48550/arxiv.1904.07736 Decision Power of Weak Asynchronous Models of Distributed Computing Author(s): Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza Published in: preprint, 2021 Publisher: none Constructive expressive power of population protocols Author(s): Mikhail Raskin Published in: preprint, 2020 Publisher: none The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results Author(s): 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 Published in: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), Issue Yearly report, 2019 Publisher: none Computing Parameterized Invariants of Parameterized Petri Nets Author(s): Javier Esparza, Mikhail A. Raskin, Christoph Welzel Published in: preprint, 2021 Publisher: none A unified algorithm for colouring graphs of bounded clique-width Author(s): Bruno Courcelle, Irène Durand, Michael Raskin Published in: preprint, 2020 Publisher: none Conference proceedings (57) Abstraction-Based Segmental Simulation of Chemical Reaction Networks Author(s): Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek Published in: Computational Methods in Systems Biology - 20th International Conference, {CMSB} 2022, 2022, Page(s) 41--60, ISBN 978-3-031-15034-0 Publisher: Springer DOI: 10.1007/978-3-031-15034-0_3 Fast and Succinct Population Protocols for Presburger Arithmetic Author(s): Czerner, Philipp; Guttenberg, Roland; Helfrich, Martin; Esparza, Javier Published in: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Issue 221, 2022, Page(s) 11:1--11:17, ISBN 978-3-95977-224-2 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.sand.2022.11 Separators in Continuous Petri Nets Author(s): Michael Blondin, Javier Esparza Published in: Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, 2022, Page(s) 81--100 Publisher: Springer DOI: 10.1007/978-3-030-99253-8_5 Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version) Author(s): Balasubramanian, A. R.; Guillou, Lucie; Weil-Kennedy, Chana Published in: FoSSaCS 2022: Foundations of Software Science and Computation Structures, 2022, Page(s) 61–80, ISBN 978-3-030-99253-8 Publisher: Springer DOI: 10.1007/978-3-030-99253-8_4 Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling Author(s): Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera, Philipp J. Meyer Published in: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II, Issue 12225, 2020, Page(s) 372-397, ISBN 978-3-030-53290-1 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-53291-8_20 Abduction of trap invariants in parameterized systems Author(s): Javier Esparza, Mikhail A. Raskin, Christoph Welzel Published in: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, 2021, Page(s) 1--17 Publisher: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS) DOI: 10.4204/eptcs.346.1 Geometry of Reachability Sets of Vector Addition Systems Author(s): Roland Guttenberg, Mikhail A. Raskin, Javier Esparza Published in: 34th International Conference on Concurrency Theory, CONCUR 2023, 2023 Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik DOI: 10.4230/lipics.concur.2023.6 Computing Parameterized Invariants of Parameterized Petri Nets Author(s): Javier Esparza, Mikhail A. Raskin, Christoph Welzel Published in: Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS 2021, Issue 12734, 2021, Page(s) 141--163 Publisher: Springer DOI: 10.1007/978-3-030-76983-3_8 Giant Components in Random Temporal Graphs Author(s): Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, 2023 Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik DOI: 10.4230/lipics.approx/random.2023.29 Brief Announcement: Population Protocols Decide Double-exponential Thresholds Author(s): Philipp Czerner Published in: 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, 2023 Publisher: ACM DOI: 10.1145/3583668.3594571 Coefficient Synthesis for Threshold Automata Author(s): Balasubramanian, A.R. Published in: Reachability Problems - 16th International Conference, RP 2022, Issue 13608, 2022, Page(s) 125--139, ISBN 978-3-031-19135-0 Publisher: Springer DOI: 10.1007/978-3-031-19135-0_9 Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics Author(s): A. R. Balasubramanian, Timo Lang, Revantha Ramanayake Published in: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Page(s) 1--13 Publisher: IEEE DOI: 10.1109/lics52264.2021.9470733 QueryFS: compiling queries to define a filesystem Author(s): Raskin, Michael Published in: The 15th European Lisp Symposium (ELS'22), Issue 3, 2022 Publisher: Zenodo DOI: 10.5281/zenodo.6308532 Characterizing Consensus in the Heard-Of Model Author(s): A. R. Balasubramanian, Igor Walukiewicz Published in: 31st International Conference on Concurrency Theory, CONCUR 2020, Issue 171, 2020, Page(s) 9:1--9:18 Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik DOI: 10.4230/lipics.concur.2020.9 A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries Author(s): Nathalie Bertrand, Marijana Lazic, Josef Widder Published in: Verification, Model Checking, and Abstract Interpretation, 2021, Page(s) 219--239 Publisher: Springer DOI: 10.1007/978-3-030-67067-2_11 Certifying Inexpressibility Author(s): Orna Kupferman, Salomon Sickert Published in: 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, Issue 12650, 2021, Page(s) 385-405, ISBN 978-3-030-71994-4 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-71995-1_20 Lower Bounds on the State Complexity of Population Protocols Author(s): Philipp Czerner; Javier Esparza Published in: The 2021 ACM Symposium on Principles of Distributed Computing (PODC), Issue 2, 2021, Page(s) 45--54 Publisher: Association for Computing Machinery (ACM) DOI: 10.1145/3465084.3467912 Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent Author(s): A. R. Balasubramanian; Chana Weil-Kennedy Published in: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Issue 1, 2021, Page(s) 18--34 Publisher: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS) DOI: 10.48550/arxiv.2109.08315 Complexity of Coverability in Depth-Bounded Processes Author(s): Balasubramanian, A. R. Published in: 33rd International Conference on Concurrency Theory (CONCUR 2022), Issue 243, 2022, Page(s) 17:1--17:19, ISBN 978-3-95977-246-4 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.concur.2022.17 Tutorial: Parameterized Verification with Byzantine Model Checker Author(s): Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder Published in: Formal Techniques for Distributed Objects, Components, and Systems - FORTE 2020, 2020 Publisher: Springer DOI: 10.1007/978-3-030-50086-3_11 Flatness and Complexity of Immediate Observation Petri Nets Author(s): Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza Published in: 31st International Conference on Concurrency Theory, CONCUR 2020, Issue 171, 2020, Page(s) 45:1--45:19 Publisher: 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 Author(s): Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer Published in: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Issue 12302, 2020, Page(s) 550-556, ISBN 978-3-030-59151-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-59152-6_32 Affine Extensions of Integer Vector Addition Systems with States Author(s): Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail Raskin Published in: 29th International Conference on Concurrency Theory (CONCUR 2018), 2018, Page(s) 14:1--14:17, ISBN 978-3-95977-087-3 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.concur.2018.14 Decision Power of Weak Asynchronous Models of Distributed Computing Author(s): Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza Published in: PODC, Issue 13, 2021 Publisher: ACM DOI: 10.48550/arxiv.2102.11630 A Simple Rewrite System for the Normalization of Linear Temporal Logic Author(s): Javier Esparza, Ruben Rubio, Salomon Sickert Published in: Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, Issue 13660, 2022, Page(s) 208--227 Publisher: Springer DOI: 10.1007/978-3-031-22337-2_10 Verification of Immediate Observation Population Protocols Author(s): Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy Published in: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/LIPIcs.CONCUR.2018.31 Automatic Analysis of Expected Termination Time for Population Protocols Author(s): Michael Blondin, Javier Esparza, Antonín Kučera Published in: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/LIPIcs.CONCUR.2018.33 Parameterized Analysis of Immediate Observation Petri Nets Author(s): Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy Published in: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23–28, 2019, Proceedings, Issue 11522, 2019, Page(s) 365-385, ISBN 978-3-030-21570-5 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-21571-2_20 Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics Author(s): Idan Berkovits, Marijana Lazić, Giuliano Losa, Oded Padon, Sharon Shoham Published in: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, Issue 11562, 2019, Page(s) 245-266, ISBN 978-3-030-25542-8 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-25543-5_15 Computing the Expected Execution Time of Probabilistic Workflow Nets Author(s): Philipp J. Meyer, Javier Esparza, Philip Offtermatt Published in: 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, Issue 11428, 2019, Page(s) 154-171, ISBN 978-3-030-17464-4 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-17465-1_9 Working with first-order proofs and provers Author(s): Mikhail Raskin, Christoph Welzel Published in: 12-th European Lisp Symposium (ELS 2019), 2019 Publisher: ELS DOI: 10.5281/zenodo.2633990 Expressive Power of Broadcast Consensus Protocols Author(s): Michael Blondin, Javier Esparza, Stefan Jaax Published in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Page(s) 31:1--31:16, ISBN 978-3-95977-121-4 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.concur.2019.31 Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries Author(s): Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder Published in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Page(s) 33:1--33:15, ISBN 978-3-95977-121-4 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.concur.2019.33 How to Win First-Order Safety Games Author(s): Helmut Seidl, Christian Müller, Bernd Finkbeiner Published in: Verification, Model Checking, and Abstract Interpretation - 21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16–21, 2020, Proceedings, Issue 11990, 2020, Page(s) 426-448, ISBN 978-3-030-39321-2 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-39322-9_20 Succinct Population Protocols for Presburger Arithmetic Author(s): Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax Published in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Issue volume 154, 2020, Page(s) 40:1--40:15, ISBN 978-3-95977-140-5 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.stacs.2020.40 Wait-Free Solvability of Equality Negation Tasks Author(s): Eric Goubault, Marijana Lazic, Jeremy Ledent, Sergio Rajsbaum Published in: 33rd International Symposium on Distributed Computing (DISC 2019), Issue Volume 146, 2019, Page(s) 21:1--21:16, ISBN 978-3-95977-126-9 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.disc.2019.21 A Dynamic Epistemic Logic Analysis of the Equality Negation Task Author(s): Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum Published in: Dynamic Logic. New Trends and Applications - Second International Workshop, DaLí 2019, Porto, Portugal, October 7–11, 2019, Proceedings, Issue 12005, 2020, Page(s) 53-70, ISBN 978-3-030-38807-2 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-38808-9_4 Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead Author(s): Michael Raskin, Mark Simkin Published in: 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, Issue 11922, 2019, Page(s) 537-563, ISBN 978-3-030-34620-1 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-34621-8_19 Population Protocols with Unreliable Communication Author(s): Mikhail Raskin Published in: Algorithms for Sensor Systems, ALGOSENSORS 2021, Issue 12961, 2021, Page(s) 140--154, ISBN 978-3-030-89240-1 Publisher: Springer DOI: 10.1007/978-3-030-89240-1_10 On Affine Reachability Problems Author(s): Stefan Jaax, Stefan Kiefer Published in: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 2020 Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik DOI: 10.4230/lipics.mfcs.2020.48 Structural Invariants for the Verification of Systems with Parameterized Architectures Author(s): Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel Published in: 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, Issue 12078, 2020, Page(s) 228-246, ISBN 978-3-030-45189-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-45190-5_13 The Complexity of Reachability in Affine Vector Addition Systems with States Author(s): Michael Blondin, Mikhail Raskin Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 224-236, ISBN 9781-450371049 Publisher: ACM DOI: 10.1145/3373718.3394741 An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata Author(s): Salomon Sickert, Javier Esparza Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 831-844, ISBN 9781-450371049 Publisher: ACM DOI: 10.1145/3373718.3394743 Complexity of controlled bad sequences over finite sets of Nd Author(s): A. R. Balasubramanian Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 130-140, ISBN 9781-450371049 Publisher: ACM DOI: 10.1145/3373718.3394753 Efficient Restrictions of Immediate Observation Petri Nets Author(s): Michael Raskin, Chana Weil-Kennedy Published in: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings, Issue 12448, 2020, Page(s) 99-114, ISBN 978-3-030-61738-7 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-61739-4_7 Making IP = PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms Author(s): Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar Published in: 35th International Conference on Computer Aided Verification, CAV 2023, 2023 Publisher: Springer DOI: 10.1007/978-3-031-37709-9_21 Running Time Analysis of Broadcast Consensus Protocols Author(s): Philipp Czerner, Stefan Jaax Published in: 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, Issue 12650, 2021, Page(s) 164-183, ISBN 978-3-030-71994-4 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-71995-1_9 Practical Applications of the Alternating Cycle Decomposition Author(s): Antonio Casares, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert Published in: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, 2022, Page(s) 99--117 Publisher: Springer DOI: 10.1007/978-3-030-99527-0_6 Regular Model Checking Upside-Down: An Invariant-Based Approach Author(s): Esparza, Javier; Raskin, Mikhail; Welzel, Christoph Published in: 33rd International Conference on Concurrency Theory (CONCUR 2022), Issue 1, 2022, Page(s) 23:1 -- 23:19, ISBN 978-3-95977-246-4 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.concur.2022.23 Complexity of Verification and Synthesis of Threshold Automata Author(s): A. R. Balasubramanian, Javier Esparza, Marijana Lazić Published in: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Issue 12302, 2020, Page(s) 144-160, ISBN 978-3-030-59151-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-59152-6_8 Holistic Verification of Blockchain Consensus Author(s): Bertrand, Nathalie ; Gramoli, Vincent ; Konnov, Igor ; Lazić, Marijana ; Tholoniat, Pierre ; Widder, Josef Published in: 36th International Symposium on Distributed Computing (DISC 2022), Issue 246, 2022, Page(s) 10:1--10:24, ISBN 978-3-95977-255-6 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.disc.2022.10 Complexity of Coverability in Bounded Path Broadcast Networks Author(s): Balasubramanian, A. R. Published in: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Issue 213, 2021, Page(s) 35:1--35:16, ISBN 978-3-95977-215-0 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.fsttcs.2021.35 Lisp in the middle: using Lisp to manage a Linux system Author(s): Raskin, Michael Published in: The 14th European Lisp Symposium (ELS'21), Issue 4, 2021, ISSN 2677-3465 Publisher: Zenodo DOI: 10.5281/zenodo.4724166 Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy Author(s): A. R. Balasubramanian, Javier Esparza, Mikhail Raskin Published in: 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, Issue 12650, 2021, Page(s) 42-61, ISBN 978-3-030-71994-4 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-71995-1_3 A Classification of Weak Asynchronous Models of Distributed Computing Author(s): Javier Esparza, Fabian Reiter Published in: 31st International Conference on Concurrency Theory, CONCUR 2020, Issue 171, 2020, Page(s) 10:1--10:16 Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik DOI: 10.4230/lipics.concur.2020.10 Population Protocols: Beyond Runtime Analysis Author(s): Esparza, Javier Published in: Reachability Problems - 15th International Conference, RP 2021, 2021, Page(s) 28--51, ISBN 978-3-030-89716-1 Publisher: Springer DOI: 10.1007/978-3-030-89716-1_3 Sharp Thresholds in Random Simple Temporal Graphs Author(s): Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev Published in: 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, Page(s) 319-326, ISBN 978-1-6654-2055-6 Publisher: IEEE DOI: 10.1109/focs52979.2021.00040 Thesis and dissertations (8) Proving Noninterference in Multi-Agent Systems Author(s): Christian Müller Published in: 2020 Publisher: 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) Author(s): Martin Helfrich Published in: 2023 Publisher: Technical University of Munich Computational Complexity of the Verification of Parameterized Systems (under review, will be published under open access by the university library) Author(s): A.R. Balasubramanian Published in: 2023 Publisher: Technical University of Munich Observation Petri Nets Author(s): Chana Weil-Kennedy Published in: 2023 Publisher: Technical University of Munich Inductive Statements for Regular Transition Systems (under review, will be published under open access by the university library) Author(s): Christoph Welzel-Mohr Published in: 2023 Publisher: Technical University of Munich A Unified Translation of Linear Temporal Logic to Omega-Automata Author(s): Salomon Sickert Published in: 2019 Publisher: Technical University of Munich Constraint-based Analysis of Distributed Systems Author(s): Philipp Klara Johanna Meyer Published in: 2021 Publisher: Technical University of Munich Population Protocols: Expressiveness, Succinctness and Automatic Verification Author(s): Stefan Jaax Published in: 2020 Publisher: Technical University of Munich Peer reviewed articles (20) Regular Model Checking Upside-Down: An Invariant-Based Approach (submitted, under review) Author(s): Javier Esparza, Mikhail Raskin, Christoph Welzel Published in: Logical Methods in Computer Science, 2023, ISSN 1860-5974 Publisher: Technischen Universitat Braunschweig DOI: 10.48550/arxiv.2205.03060 A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks Author(s): Hans van Ditmarsch, Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum Published in: Journal of Logical and Algebraic Methods in Programming, Issue 121, 2021, Page(s) 100662, ISSN 2352-2208 Publisher: Elsevier DOI: 10.1016/j.jlamp.2021.100662 Parameterized verification of coverability in infinite state broadcast networks Author(s): A. R. Balasubramanian Published in: Information and Computation, Issue Volume 278, 2021, ISSN 0890-5401 Publisher: Academic Press DOI: 10.1016/j.ic.2020.104592 A Unified Translation of Linear Temporal Logic to ω-Automata Author(s): Javier Esparza, Jan Křetínský, Salomon Sickert Published in: Journal of the ACM, Issue 67/6, 2020, Page(s) 1-61, ISSN 0004-5411 Publisher: Association for Computing Machinary, Inc. DOI: 10.1145/3417995 Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker Author(s): Igor Konnov; Marijana Lazić; Ilina Stoilkovska; Josef Widder Published in: Logical Methods in Computer Science, Issue Volume 19, Issue 1, 2023, Page(s) 5:1 -- 5:37, ISSN 1860-5974 Publisher: Technischen Universitat Braunschweig DOI: 10.48550/arxiv.2011.14789 Lower bounds on the state complexity of population protocols Author(s): Philipp Czerner, Javier Esparza, Jérôme Leroux Published in: Distributed Computing, 2023, ISSN 1432-0452 Publisher: Springer DOI: 10.1007/s00446-023-00450-4 Computing Parameterized Invariants of Parameterized Petri Nets Author(s): Javier Esparza; Mikhail Raskin; Christoph Welzel Published in: Fundamental Informaticae, Issue 1, 2022, Page(s) 197--243, ISSN 0169-2968 Publisher: IOS Press DOI: 10.3233/fi-222137 From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata Author(s): Javier Esparza, Jan Křetínský, Jean-François Raskin, Salomon Sickert Published in: International Journal on Software Tools for Technology Transfer, Issue 24, 2022, Page(s) 635–659, ISSN 1433-2779 Publisher: Springer Verlag DOI: 10.1007/s10009-022-00663-1 Efficient Normalization of Linear Temporal Logic (submitted, subject to minor revisions) Author(s): Javier Esparza, Rubén Rubio, Salomon Sickert Published in: Journal of the ACM, 2023, ISSN 0004-5411 Publisher: Association for Computing Machinary, Inc. DOI: 10.48550/arxiv.2310.12613 Practical synthesis of reactive systems from LTL specifications via parity games Author(s): Michael Luttenberger, Philipp J. Meyer, Salomon Sickert Published in: Acta Informatica, 2019, ISSN 0001-5903 Publisher: Springer Verlag DOI: 10.1007/s00236-019-00349-3 A Stay-in-a-Set Game without a Stationary Equilibrium Author(s): Kristoffer Arnsfelt Hansen, Mikhail Raskin Published in: Electronic Proceedings in Theoretical Computer Science, Issue 305, 2019, Page(s) 83-90, ISSN 2075-2180 Publisher: Electronic Proceedings in Theoretical Computer Science DOI: 10.4204/eptcs.305.6 On defining linear orders by automata Author(s): Bruno Courcelle, Irène Durand, Michael Raskin Published in: Moscow Journal of Combinatorics and Number Theory, Issue 9/3, 2020, Page(s) 253-291, ISSN 2640-7361 Publisher: Mathematical Sciences Publishers DOI: 10.2140/moscow.2020.9.253 Affine Extensions of Integer Vector Addition Systems with States Author(s): Michael Blondin ; Christoph Haase ; Filip Mazowiecki ; Mikhail Raskin Published in: Logical Methods in Computer Science, Issue Volume 17, Issue 3, 2021, Page(s) 1:1–1:26, ISSN 1860-5974 Publisher: Technischen Universitat Braunschweig DOI: 10.46298/lmcs-17(3:1)2021 Fast and Succinct Population Protocols for Presburger Arithmetic Author(s): Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza Published in: Journal of Computer and System Sciences, 2023, ISSN 0022-0000 Publisher: Academic Press DOI: 10.1016/j.jcss.2023.103481 Towards efficient verification of population protocols Author(s): Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer Published in: Formal Methods in System Design, 2021, ISSN 0925-9856 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10703-021-00367-3 Certifying Inexpressibility Author(s): Orna Kupferman; Salomon Sickert Published in: Foundations of Software Science and Computation Structures, Issue 1, 2021, Page(s) 385--405, ISSN 0302-9743 Publisher: Springer Verlag DOI: 10.48550/arxiv.2101.08756 The complexity of verifying population protocols Author(s): Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy Published in: Distributed Computing, Issue 34/2, 2021, Page(s) 133-177, ISSN 0178-2770 Publisher: Springer Verlag DOI: 10.1007/s00446-021-00390-x The Complexity of Reachability in Affine Vector Addition Systems with States Author(s): Michael Blondin ; Mikhail Raskin Published in: Logical Methods in Computer Science, Issue Volume 17, Issue 3, 2021, ISSN 1860-5974 Publisher: Technischen Universitat Braunschweig DOI: 10.46298/lmcs-17(3:3)2021 Protocols with constant local storage and unreliable communication Author(s): Mikhail Raskin Published in: Theoretical Computer Science, Issue Volume 940, Part A, 2023, Page(s) 269--282, ISSN 0304-3975 Publisher: Elsevier BV DOI: 10.1016/j.tcs.2022.11.006 Verification of randomized consensus algorithms under round-rigid adversaries Author(s): Nathalie Bertrand, Igor Konnov, Marijana Lazić, Josef Widder Published in: International Journal on Software Tools for Technology Transfer, Issue 23, 2021, Page(s) 797--821, ISSN 1433-2779 Publisher: Springer Verlag DOI: 10.1007/s10009-020-00603-x Searching for OpenAIRE data... There was an error trying to search data from OpenAIRE No results available
