Parametrized Verification and Synthesis

Adaptive Synchronisation of Pushdown Automata

Autores: A. R. Balasubramanian, K. S. Thejaswini
Publicado en: preprint, 2021
Editor: none

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

Autores: 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
Publicado en: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), 2019
Editor: none
DOI: 10.48550/arxiv.1904.07736

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

Autores: 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
Publicado en: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), Edición Yearly report, 2019
Editor: none

Abstraction-Based Segmental Simulation of Chemical Reaction Networks

Autores: Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek
Publicado en: Computational Methods in Systems Biology - 20th International Conference, {CMSB} 2022, 2022, Página(s) 41--60, ISBN 978-3-031-15034-0
Editor: Springer
DOI: 10.1007/978-3-031-15034-0_3

Fast and Succinct Population Protocols for Presburger Arithmetic

Autores: Czerner, Philipp; Guttenberg, Roland; Helfrich, Martin; Esparza, Javier
Publicado en: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Edición 221, 2022, Página(s) 11:1--11:17, ISBN 978-3-95977-224-2
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.sand.2022.11

Separators in Continuous Petri Nets

Autores: Michael Blondin, Javier Esparza
Publicado en: Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, 2022, Página(s) 81--100
Editor: Springer
DOI: 10.1007/978-3-030-99253-8_5

Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version)

Autores: Balasubramanian, A. R.; Guillou, Lucie; Weil-Kennedy, Chana
Publicado en: FoSSaCS 2022: Foundations of Software Science and Computation Structures, 2022, Página(s) 61–80, ISBN 978-3-030-99253-8
Editor: Springer
DOI: 10.1007/978-3-030-99253-8_4

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling

Autores: Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera, Philipp J. Meyer
Publicado en: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II, Edición 12225, 2020, Página(s) 372-397, ISBN 978-3-030-53290-1
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-53291-8_20

Abduction of trap invariants in parameterized systems

Autores: Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Publicado en: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, 2021, Página(s) 1--17
Editor: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS)
DOI: 10.4204/eptcs.346.1

Geometry of Reachability Sets of Vector Addition Systems

Autores: Roland Guttenberg, Mikhail A. Raskin, Javier Esparza
Publicado en: 34th International Conference on Concurrency Theory, CONCUR 2023, 2023
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2023.6

Computing Parameterized Invariants of Parameterized Petri Nets

Autores: Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Publicado en: Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS 2021, Edición 12734, 2021, Página(s) 141--163
Editor: Springer
DOI: 10.1007/978-3-030-76983-3_8

Giant Components in Random Temporal Graphs

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

Brief Announcement: Population Protocols Decide Double-exponential Thresholds

Autores: Philipp Czerner
Publicado en: 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, 2023
Editor: ACM
DOI: 10.1145/3583668.3594571

Coefficient Synthesis for Threshold Automata

Autores: Balasubramanian, A.R.
Publicado en: Reachability Problems - 16th International Conference, RP 2022, Edición 13608, 2022, Página(s) 125--139, ISBN 978-3-031-19135-0
Editor: Springer
DOI: 10.1007/978-3-031-19135-0_9

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

Autores: A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Publicado en: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Página(s) 1--13
Editor: IEEE
DOI: 10.1109/lics52264.2021.9470733

QueryFS: compiling queries to define a filesystem

Autores: Raskin, Michael
Publicado en: The 15th European Lisp Symposium (ELS'22), Edición 3, 2022
Editor: Zenodo
DOI: 10.5281/zenodo.6308532

Characterizing Consensus in the Heard-Of Model

Autores: A. R. Balasubramanian, Igor Walukiewicz
Publicado en: 31st International Conference on Concurrency Theory, CONCUR 2020, Edición 171, 2020, Página(s) 9:1--9:18
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.9

A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries

Autores: Nathalie Bertrand, Marijana Lazic, Josef Widder
Publicado en: Verification, Model Checking, and Abstract Interpretation, 2021, Página(s) 219--239
Editor: Springer
DOI: 10.1007/978-3-030-67067-2_11

Certifying Inexpressibility

Autores: Orna Kupferman, Salomon Sickert
Publicado en: 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, Edición 12650, 2021, Página(s) 385-405, ISBN 978-3-030-71994-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_20

Lower Bounds on the State Complexity of Population Protocols

Autores: Philipp Czerner; Javier Esparza
Publicado en: The 2021 ACM Symposium on Principles of Distributed Computing (PODC), Edición 2, 2021, Página(s) 45--54
Editor: Association for Computing Machinery (ACM)
DOI: 10.1145/3465084.3467912

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent

Autores: A. R. Balasubramanian; Chana Weil-Kennedy
Publicado en: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Edición 1, 2021, Página(s) 18--34
Editor: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS)
DOI: 10.48550/arxiv.2109.08315

Complexity of Coverability in Depth-Bounded Processes

Autores: Balasubramanian, A. R.
Publicado en: 33rd International Conference on Concurrency Theory (CONCUR 2022), Edición 243, 2022, Página(s) 17:1--17:19, ISBN 978-3-95977-246-4
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2022.17

Tutorial: Parameterized Verification with Byzantine Model Checker

Autores: Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder
Publicado en: Formal Techniques for Distributed Objects, Components, and Systems - FORTE 2020, 2020
Editor: Springer
DOI: 10.1007/978-3-030-50086-3_11

Flatness and Complexity of Immediate Observation Petri Nets

Autores: Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza
Publicado en: 31st International Conference on Concurrency Theory, CONCUR 2020, Edición 171, 2020, Página(s) 45:1--45:19
Editor: 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

Autores: Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer
Publicado en: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Edición 12302, 2020, Página(s) 550-556, ISBN 978-3-030-59151-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_32

Affine Extensions of Integer Vector Addition Systems with States

Autores: Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail Raskin
Publicado en: 29th International Conference on Concurrency Theory (CONCUR 2018), 2018, Página(s) 14:1--14:17, ISBN 978-3-95977-087-3
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2018.14

Decision Power of Weak Asynchronous Models of Distributed Computing

Autores: Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza
Publicado en: PODC, Edición 13, 2021
Editor: ACM
DOI: 10.48550/arxiv.2102.11630

A Simple Rewrite System for the Normalization of Linear Temporal Logic

Autores: Javier Esparza, Ruben Rubio, Salomon Sickert
Publicado en: Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, Edición 13660, 2022, Página(s) 208--227
Editor: Springer
DOI: 10.1007/978-3-031-22337-2_10

Verification of Immediate Observation Population Protocols

Autores: Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
Publicado en: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.31

Automatic Analysis of Expected Termination Time for Population Protocols

Autores: Michael Blondin, Javier Esparza, Antonín Kučera
Publicado en: 29th International Conference on Concurrency Theory, CONCUR 2018, 2018, ISBN 978-3-95977-087-3
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CONCUR.2018.33

Parameterized Analysis of Immediate Observation Petri Nets

Autores: Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy
Publicado en: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23–28, 2019, Proceedings, Edición 11522, 2019, Página(s) 365-385, ISBN 978-3-030-21570-5
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-21571-2_20

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

Autores: Idan Berkovits, Marijana Lazić, Giuliano Losa, Oded Padon, Sharon Shoham
Publicado en: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, Edición 11562, 2019, Página(s) 245-266, ISBN 978-3-030-25542-8
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-25543-5_15

Computing the Expected Execution Time of Probabilistic Workflow Nets

Autores: Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Publicado en: 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, Edición 11428, 2019, Página(s) 154-171, ISBN 978-3-030-17464-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-17465-1_9

Working with first-order proofs and provers

Autores: Mikhail Raskin, Christoph Welzel
Publicado en: 12-th European Lisp Symposium (ELS 2019), 2019
Editor: ELS
DOI: 10.5281/zenodo.2633990

Expressive Power of Broadcast Consensus Protocols

Autores: Michael Blondin, Javier Esparza, Stefan Jaax
Publicado en: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Página(s) 31:1--31:16, ISBN 978-3-95977-121-4
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.31

Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries

Autores: Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Publicado en: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Página(s) 33:1--33:15, ISBN 978-3-95977-121-4
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.33

How to Win First-Order Safety Games

Autores: Helmut Seidl, Christian Müller, Bernd Finkbeiner
Publicado en: Verification, Model Checking, and Abstract Interpretation - 21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16–21, 2020, Proceedings, Edición 11990, 2020, Página(s) 426-448, ISBN 978-3-030-39321-2
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-39322-9_20

Succinct Population Protocols for Presburger Arithmetic

Autores: Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Publicado en: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Edición volume 154, 2020, Página(s) 40:1--40:15, ISBN 978-3-95977-140-5
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.40

Wait-Free Solvability of Equality Negation Tasks

Autores: Eric Goubault, Marijana Lazic, Jeremy Ledent, Sergio Rajsbaum
Publicado en: 33rd International Symposium on Distributed Computing (DISC 2019), Edición Volume 146, 2019, Página(s) 21:1--21:16, ISBN 978-3-95977-126-9
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2019.21

A Dynamic Epistemic Logic Analysis of the Equality Negation Task

Autores: Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Publicado en: Dynamic Logic. New Trends and Applications - Second International Workshop, DaLí 2019, Porto, Portugal, October 7–11, 2019, Proceedings, Edición 12005, 2020, Página(s) 53-70, ISBN 978-3-030-38807-2
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-38808-9_4

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

Autores: Michael Raskin, Mark Simkin
Publicado en: 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, Edición 11922, 2019, Página(s) 537-563, ISBN 978-3-030-34620-1
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-34621-8_19

Population Protocols with Unreliable Communication

Autores: Mikhail Raskin
Publicado en: Algorithms for Sensor Systems, ALGOSENSORS 2021, Edición 12961, 2021, Página(s) 140--154, ISBN 978-3-030-89240-1
Editor: Springer
DOI: 10.1007/978-3-030-89240-1_10

On Affine Reachability Problems

Autores: Stefan Jaax, Stefan Kiefer
Publicado en: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 2020
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2020.48

Structural Invariants for the Verification of Systems with Parameterized Architectures

Autores: Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel
Publicado en: 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, Edición 12078, 2020, Página(s) 228-246, ISBN 978-3-030-45189-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-45190-5_13

The Complexity of Reachability in Affine Vector Addition Systems with States

Autores: Michael Blondin, Mikhail Raskin
Publicado en: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Página(s) 224-236, ISBN 9781-450371049
Editor: ACM
DOI: 10.1145/3373718.3394741

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

Autores: Salomon Sickert, Javier Esparza
Publicado en: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Página(s) 831-844, ISBN 9781-450371049
Editor: ACM
DOI: 10.1145/3373718.3394743

Complexity of controlled bad sequences over finite sets of Nd

Autores: A. R. Balasubramanian
Publicado en: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Página(s) 130-140, ISBN 9781-450371049
Editor: ACM
DOI: 10.1145/3373718.3394753

Efficient Restrictions of Immediate Observation Petri Nets

Autores: Michael Raskin, Chana Weil-Kennedy
Publicado en: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings, Edición 12448, 2020, Página(s) 99-114, ISBN 978-3-030-61738-7
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-61739-4_7

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

Autores: Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar
Publicado en: 35th International Conference on Computer Aided Verification, CAV 2023, 2023
Editor: Springer
DOI: 10.1007/978-3-031-37709-9_21

Running Time Analysis of Broadcast Consensus Protocols

Autores: Philipp Czerner, Stefan Jaax
Publicado en: 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, Edición 12650, 2021, Página(s) 164-183, ISBN 978-3-030-71994-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_9

Practical Applications of the Alternating Cycle Decomposition

Autores: Antonio Casares, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert
Publicado en: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, 2022, Página(s) 99--117
Editor: Springer
DOI: 10.1007/978-3-030-99527-0_6

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

Autores: Esparza, Javier; Raskin, Mikhail; Welzel, Christoph
Publicado en: 33rd International Conference on Concurrency Theory (CONCUR 2022), Edición 1, 2022, Página(s) 23:1 -- 23:19, ISBN 978-3-95977-246-4
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2022.23

Complexity of Verification and Synthesis of Threshold Automata

Autores: A. R. Balasubramanian, Javier Esparza, Marijana Lazić
Publicado en: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Edición 12302, 2020, Página(s) 144-160, ISBN 978-3-030-59151-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_8

Holistic Verification of Blockchain Consensus

Autores: Bertrand, Nathalie ; Gramoli, Vincent ; Konnov, Igor ; Lazić, Marijana ; Tholoniat, Pierre ; Widder, Josef
Publicado en: 36th International Symposium on Distributed Computing (DISC 2022), Edición 246, 2022, Página(s) 10:1--10:24, ISBN 978-3-95977-255-6
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2022.10

Complexity of Coverability in Bounded Path Broadcast Networks

Autores: Balasubramanian, A. R.
Publicado en: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Edición 213, 2021, Página(s) 35:1--35:16, ISBN 978-3-95977-215-0
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.fsttcs.2021.35

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

Autores: Raskin, Michael
Publicado en: The 14th European Lisp Symposium (ELS'21), Edición 4, 2021, ISSN 2677-3465
Editor: Zenodo
DOI: 10.5281/zenodo.4724166

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

Autores: A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
Publicado en: 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, Edición 12650, 2021, Página(s) 42-61, ISBN 978-3-030-71994-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_3

A Classification of Weak Asynchronous Models of Distributed Computing

Autores: Javier Esparza, Fabian Reiter
Publicado en: 31st International Conference on Concurrency Theory, CONCUR 2020, Edición 171, 2020, Página(s) 10:1--10:16
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.10

Population Protocols: Beyond Runtime Analysis

Autores: Esparza, Javier
Publicado en: Reachability Problems - 15th International Conference, RP 2021, 2021, Página(s) 28--51, ISBN 978-3-030-89716-1
Editor: Springer
DOI: 10.1007/978-3-030-89716-1_3

Sharp Thresholds in Random Simple Temporal Graphs

Autores: Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Publicado en: 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, Página(s) 319-326, ISBN 978-1-6654-2055-6
Editor: IEEE
DOI: 10.1109/focs52979.2021.00040

Proving Noninterference in Multi-Agent Systems

Autores: Christian Müller
Publicado en: 2020
Editor: 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)

Autores: Martin Helfrich
Publicado en: 2023
Editor: Technical University of Munich

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

Autores: A.R. Balasubramanian
Publicado en: 2023
Editor: Technical University of Munich

Observation Petri Nets

Autores: Chana Weil-Kennedy
Publicado en: 2023
Editor: Technical University of Munich

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

Autores: Christoph Welzel-Mohr
Publicado en: 2023
Editor: Technical University of Munich

Constraint-based Analysis of Distributed Systems

Autores: Philipp Klara Johanna Meyer
Publicado en: 2021
Editor: Technical University of Munich

Population Protocols: Expressiveness, Succinctness and Automatic Verification

Autores: Stefan Jaax
Publicado en: 2020
Editor: Technical University of Munich

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

Autores: Javier Esparza, Mikhail Raskin, Christoph Welzel
Publicado en: Logical Methods in Computer Science, 2023, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2205.03060

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

Autores: Hans van Ditmarsch, Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Publicado en: Journal of Logical and Algebraic Methods in Programming, Edición 121, 2021, Página(s) 100662, ISSN 2352-2208
Editor: Elsevier
DOI: 10.1016/j.jlamp.2021.100662

Parameterized verification of coverability in infinite state broadcast networks

Autores: A. R. Balasubramanian
Publicado en: Information and Computation, Edición Volume 278, 2021, ISSN 0890-5401
Editor: Academic Press
DOI: 10.1016/j.ic.2020.104592

A Unified Translation of Linear Temporal Logic to ω-Automata

Autores: Javier Esparza, Jan Křetínský, Salomon Sickert
Publicado en: Journal of the ACM, Edición 67/6, 2020, Página(s) 1-61, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3417995

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

Autores: Igor Konnov; Marijana Lazić; Ilina Stoilkovska; Josef Widder
Publicado en: Logical Methods in Computer Science, Edición Volume 19, Edición 1, 2023, Página(s) 5:1 -- 5:37, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2011.14789

Lower bounds on the state complexity of population protocols

Autores: Philipp Czerner, Javier Esparza, Jérôme Leroux
Publicado en: Distributed Computing, 2023, ISSN 1432-0452
Editor: Springer
DOI: 10.1007/s00446-023-00450-4

Computing Parameterized Invariants of Parameterized Petri Nets

Autores: Javier Esparza; Mikhail Raskin; Christoph Welzel
Publicado en: Fundamental Informaticae, Edición 1, 2022, Página(s) 197--243, ISSN 0169-2968
Editor: IOS Press
DOI: 10.3233/fi-222137

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

Autores: Javier Esparza, Jan Křetínský, Jean-François Raskin, Salomon Sickert
Publicado en: International Journal on Software Tools for Technology Transfer, Edición 24, 2022, Página(s) 635–659, ISSN 1433-2779
Editor: Springer Verlag
DOI: 10.1007/s10009-022-00663-1

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

Autores: Javier Esparza, Rubén Rubio, Salomon Sickert
Publicado en: Journal of the ACM, 2023, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.48550/arxiv.2310.12613

Practical synthesis of reactive systems from LTL specifications via parity games

Autores: Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
Publicado en: Acta Informatica, 2019, ISSN 0001-5903
Editor: Springer Verlag
DOI: 10.1007/s00236-019-00349-3

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

Autores: Kristoffer Arnsfelt Hansen, Mikhail Raskin
Publicado en: Electronic Proceedings in Theoretical Computer Science, Edición 305, 2019, Página(s) 83-90, ISSN 2075-2180
Editor: Electronic Proceedings in Theoretical Computer Science
DOI: 10.4204/eptcs.305.6

On defining linear orders by automata

Autores: Bruno Courcelle, Irène Durand, Michael Raskin
Publicado en: Moscow Journal of Combinatorics and Number Theory, Edición 9/3, 2020, Página(s) 253-291, ISSN 2640-7361
Editor: Mathematical Sciences Publishers
DOI: 10.2140/moscow.2020.9.253

Affine Extensions of Integer Vector Addition Systems with States

Autores: Michael Blondin ; Christoph Haase ; Filip Mazowiecki ; Mikhail Raskin
Publicado en: Logical Methods in Computer Science, Edición Volume 17, Edición 3, 2021, Página(s) 1:1–1:26, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:1)2021

Fast and Succinct Population Protocols for Presburger Arithmetic

Autores: Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Publicado en: Journal of Computer and System Sciences, 2023, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2023.103481

Towards efficient verification of population protocols

Autores: Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Publicado en: Formal Methods in System Design, 2021, ISSN 0925-9856
Editor: Kluwer Academic Publishers
DOI: 10.1007/s10703-021-00367-3

Certifying Inexpressibility

Autores: Orna Kupferman; Salomon Sickert
Publicado en: Foundations of Software Science and Computation Structures, Edición 1, 2021, Página(s) 385--405, ISSN 0302-9743
Editor: Springer Verlag
DOI: 10.48550/arxiv.2101.08756

The complexity of verifying population protocols

Autores: Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy
Publicado en: Distributed Computing, Edición 34/2, 2021, Página(s) 133-177, ISSN 0178-2770
Editor: Springer Verlag
DOI: 10.1007/s00446-021-00390-x

The Complexity of Reachability in Affine Vector Addition Systems with States

Autores: Michael Blondin ; Mikhail Raskin
Publicado en: Logical Methods in Computer Science, Edición Volume 17, Edición 3, 2021, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:3)2021

Protocols with constant local storage and unreliable communication

Autores: Mikhail Raskin
Publicado en: Theoretical Computer Science, Edición Volume 940, Part A, 2023, Página(s) 269--282, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2022.11.006

Verification of randomized consensus algorithms under round-rigid adversaries

Autores: Nathalie Bertrand, Igor Konnov, Marijana Lazić, Josef Widder
Publicado en: International Journal on Software Tools for Technology Transfer, Edición 23, 2021, Página(s) 797--821, ISSN 1433-2779
Editor: Springer Verlag
DOI: 10.1007/s10009-020-00603-x

Publicaciones

Compartir esta página

Descargar