Parametrized Verification and Synthesis

Adaptive Synchronisation of Pushdown Automata

Autori: A. R. Balasubramanian, K. S. Thejaswini
Pubblicato in: preprint, 2021
Editore: none

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

Autori: 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
Pubblicato in: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), 2019
Editore: none
DOI: 10.48550/arxiv.1904.07736

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

Autori: 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
Pubblicato in: The 5th Reactive Synthesis Competition (SYNTCOMP 2018), Numero Yearly report, 2019
Editore: none

Abstraction-Based Segmental Simulation of Chemical Reaction Networks

Autori: Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek
Pubblicato in: Computational Methods in Systems Biology - 20th International Conference, {CMSB} 2022, 2022, Pagina/e 41--60, ISBN 978-3-031-15034-0
Editore: Springer
DOI: 10.1007/978-3-031-15034-0_3

Fast and Succinct Population Protocols for Presburger Arithmetic

Autori: Czerner, Philipp; Guttenberg, Roland; Helfrich, Martin; Esparza, Javier
Pubblicato in: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Numero 221, 2022, Pagina/e 11:1--11:17, ISBN 978-3-95977-224-2
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.sand.2022.11

Separators in Continuous Petri Nets

Autori: Michael Blondin, Javier Esparza
Pubblicato in: Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, 2022, Pagina/e 81--100
Editore: Springer
DOI: 10.1007/978-3-030-99253-8_5

Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version)

Autori: Balasubramanian, A. R.; Guillou, Lucie; Weil-Kennedy, Chana
Pubblicato in: FoSSaCS 2022: Foundations of Software Science and Computation Structures, 2022, Pagina/e 61–80, ISBN 978-3-030-99253-8
Editore: Springer
DOI: 10.1007/978-3-030-99253-8_4

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling

Autori: Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera, Philipp J. Meyer
Pubblicato in: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II, Numero 12225, 2020, Pagina/e 372-397, ISBN 978-3-030-53290-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-53291-8_20

Abduction of trap invariants in parameterized systems

Autori: Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Pubblicato in: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, 2021, Pagina/e 1--17
Editore: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS)
DOI: 10.4204/eptcs.346.1

Geometry of Reachability Sets of Vector Addition Systems

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

Computing Parameterized Invariants of Parameterized Petri Nets

Autori: Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Pubblicato in: Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS 2021, Numero 12734, 2021, Pagina/e 141--163
Editore: Springer
DOI: 10.1007/978-3-030-76983-3_8

Giant Components in Random Temporal Graphs

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

Brief Announcement: Population Protocols Decide Double-exponential Thresholds

Autori: Philipp Czerner
Pubblicato in: 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, 2023
Editore: ACM
DOI: 10.1145/3583668.3594571

Coefficient Synthesis for Threshold Automata

Autori: Balasubramanian, A.R.
Pubblicato in: Reachability Problems - 16th International Conference, RP 2022, Numero 13608, 2022, Pagina/e 125--139, ISBN 978-3-031-19135-0
Editore: Springer
DOI: 10.1007/978-3-031-19135-0_9

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

Autori: A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Pubblicato in: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1--13
Editore: IEEE
DOI: 10.1109/lics52264.2021.9470733

QueryFS: compiling queries to define a filesystem

Autori: Raskin, Michael
Pubblicato in: The 15th European Lisp Symposium (ELS'22), Numero 3, 2022
Editore: Zenodo
DOI: 10.5281/zenodo.6308532

Characterizing Consensus in the Heard-Of Model

Autori: A. R. Balasubramanian, Igor Walukiewicz
Pubblicato in: 31st International Conference on Concurrency Theory, CONCUR 2020, Numero 171, 2020, Pagina/e 9:1--9:18
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.9

A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries

Autori: Nathalie Bertrand, Marijana Lazic, Josef Widder
Pubblicato in: Verification, Model Checking, and Abstract Interpretation, 2021, Pagina/e 219--239
Editore: Springer
DOI: 10.1007/978-3-030-67067-2_11

Certifying Inexpressibility

Autori: Orna Kupferman, Salomon Sickert
Pubblicato 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, Numero 12650, 2021, Pagina/e 385-405, ISBN 978-3-030-71994-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_20

Lower Bounds on the State Complexity of Population Protocols

Autori: Philipp Czerner; Javier Esparza
Pubblicato in: The 2021 ACM Symposium on Principles of Distributed Computing (PODC), Numero 2, 2021, Pagina/e 45--54
Editore: Association for Computing Machinery (ACM)
DOI: 10.1145/3465084.3467912

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent

Autori: A. R. Balasubramanian; Chana Weil-Kennedy
Pubblicato in: 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Numero 1, 2021, Pagina/e 18--34
Editore: Electronic Proceedings in Theoretical Computer Science 346 (EPTCS)
DOI: 10.48550/arxiv.2109.08315

Complexity of Coverability in Depth-Bounded Processes

Autori: Balasubramanian, A. R.
Pubblicato in: 33rd International Conference on Concurrency Theory (CONCUR 2022), Numero 243, 2022, Pagina/e 17:1--17:19, ISBN 978-3-95977-246-4
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2022.17

Tutorial: Parameterized Verification with Byzantine Model Checker

Autori: Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder
Pubblicato in: Formal Techniques for Distributed Objects, Components, and Systems - FORTE 2020, 2020
Editore: Springer
DOI: 10.1007/978-3-030-50086-3_11

Flatness and Complexity of Immediate Observation Petri Nets

Autori: Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza
Pubblicato in: 31st International Conference on Concurrency Theory, CONCUR 2020, Numero 171, 2020, Pagina/e 45:1--45:19
Editore: 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

Autori: Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer
Pubblicato in: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Numero 12302, 2020, Pagina/e 550-556, ISBN 978-3-030-59151-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_32

Affine Extensions of Integer Vector Addition Systems with States

Autori: Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail Raskin
Pubblicato in: 29th International Conference on Concurrency Theory (CONCUR 2018), 2018, Pagina/e 14:1--14:17, ISBN 978-3-95977-087-3
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2018.14

Decision Power of Weak Asynchronous Models of Distributed Computing

Autori: Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza
Pubblicato in: PODC, Numero 13, 2021
Editore: ACM
DOI: 10.48550/arxiv.2102.11630

A Simple Rewrite System for the Normalization of Linear Temporal Logic

Autori: Javier Esparza, Ruben Rubio, Salomon Sickert
Pubblicato in: Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, Numero 13660, 2022, Pagina/e 208--227
Editore: Springer
DOI: 10.1007/978-3-031-22337-2_10

Verification of Immediate Observation Population Protocols

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

Automatic Analysis of Expected Termination Time for Population Protocols

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

Parameterized Analysis of Immediate Observation Petri Nets

Autori: Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy
Pubblicato in: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23–28, 2019, Proceedings, Numero 11522, 2019, Pagina/e 365-385, ISBN 978-3-030-21570-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-21571-2_20

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

Autori: Idan Berkovits, Marijana Lazić, Giuliano Losa, Oded Padon, Sharon Shoham
Pubblicato in: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, Numero 11562, 2019, Pagina/e 245-266, ISBN 978-3-030-25542-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-25543-5_15

Computing the Expected Execution Time of Probabilistic Workflow Nets

Autori: Philipp J. Meyer, Javier Esparza, Philip Offtermatt
Pubblicato 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, Numero 11428, 2019, Pagina/e 154-171, ISBN 978-3-030-17464-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17465-1_9

Working with first-order proofs and provers

Autori: Mikhail Raskin, Christoph Welzel
Pubblicato in: 12-th European Lisp Symposium (ELS 2019), 2019
Editore: ELS
DOI: 10.5281/zenodo.2633990

Expressive Power of Broadcast Consensus Protocols

Autori: Michael Blondin, Javier Esparza, Stefan Jaax
Pubblicato in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Pagina/e 31:1--31:16, ISBN 978-3-95977-121-4
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.31

Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries

Autori: Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Pubblicato in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, Pagina/e 33:1--33:15, ISBN 978-3-95977-121-4
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.33

How to Win First-Order Safety Games

Autori: Helmut Seidl, Christian Müller, Bernd Finkbeiner
Pubblicato in: Verification, Model Checking, and Abstract Interpretation - 21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16–21, 2020, Proceedings, Numero 11990, 2020, Pagina/e 426-448, ISBN 978-3-030-39321-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-39322-9_20

Succinct Population Protocols for Presburger Arithmetic

Autori: Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Pubblicato in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Numero volume 154, 2020, Pagina/e 40:1--40:15, ISBN 978-3-95977-140-5
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2020.40

Wait-Free Solvability of Equality Negation Tasks

Autori: Eric Goubault, Marijana Lazic, Jeremy Ledent, Sergio Rajsbaum
Pubblicato in: 33rd International Symposium on Distributed Computing (DISC 2019), Numero Volume 146, 2019, Pagina/e 21:1--21:16, ISBN 978-3-95977-126-9
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2019.21

A Dynamic Epistemic Logic Analysis of the Equality Negation Task

Autori: Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Pubblicato in: Dynamic Logic. New Trends and Applications - Second International Workshop, DaLí 2019, Porto, Portugal, October 7–11, 2019, Proceedings, Numero 12005, 2020, Pagina/e 53-70, ISBN 978-3-030-38807-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-38808-9_4

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

Autori: Michael Raskin, Mark Simkin
Pubblicato 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, Numero 11922, 2019, Pagina/e 537-563, ISBN 978-3-030-34620-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-34621-8_19

Population Protocols with Unreliable Communication

Autori: Mikhail Raskin
Pubblicato in: Algorithms for Sensor Systems, ALGOSENSORS 2021, Numero 12961, 2021, Pagina/e 140--154, ISBN 978-3-030-89240-1
Editore: Springer
DOI: 10.1007/978-3-030-89240-1_10

On Affine Reachability Problems

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

Structural Invariants for the Verification of Systems with Parameterized Architectures

Autori: Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel
Pubblicato 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, Numero 12078, 2020, Pagina/e 228-246, ISBN 978-3-030-45189-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45190-5_13

The Complexity of Reachability in Affine Vector Addition Systems with States

Autori: Michael Blondin, Mikhail Raskin
Pubblicato in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Pagina/e 224-236, ISBN 9781-450371049
Editore: ACM
DOI: 10.1145/3373718.3394741

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

Autori: Salomon Sickert, Javier Esparza
Pubblicato in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Pagina/e 831-844, ISBN 9781-450371049
Editore: ACM
DOI: 10.1145/3373718.3394743

Complexity of controlled bad sequences over finite sets of Nd

Autori: A. R. Balasubramanian
Pubblicato in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Pagina/e 130-140, ISBN 9781-450371049
Editore: ACM
DOI: 10.1145/3373718.3394753

Efficient Restrictions of Immediate Observation Petri Nets

Autori: Michael Raskin, Chana Weil-Kennedy
Pubblicato in: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings, Numero 12448, 2020, Pagina/e 99-114, ISBN 978-3-030-61738-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-61739-4_7

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

Autori: Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar
Pubblicato in: 35th International Conference on Computer Aided Verification, CAV 2023, 2023
Editore: Springer
DOI: 10.1007/978-3-031-37709-9_21

Running Time Analysis of Broadcast Consensus Protocols

Autori: Philipp Czerner, Stefan Jaax
Pubblicato 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, Numero 12650, 2021, Pagina/e 164-183, ISBN 978-3-030-71994-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_9

Practical Applications of the Alternating Cycle Decomposition

Autori: Antonio Casares, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin, Salomon Sickert
Pubblicato in: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, 2022, Pagina/e 99--117
Editore: Springer
DOI: 10.1007/978-3-030-99527-0_6

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

Autori: Esparza, Javier; Raskin, Mikhail; Welzel, Christoph
Pubblicato in: 33rd International Conference on Concurrency Theory (CONCUR 2022), Numero 1, 2022, Pagina/e 23:1 -- 23:19, ISBN 978-3-95977-246-4
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2022.23

Complexity of Verification and Synthesis of Threshold Automata

Autori: A. R. Balasubramanian, Javier Esparza, Marijana Lazić
Pubblicato in: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, Numero 12302, 2020, Pagina/e 144-160, ISBN 978-3-030-59151-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-59152-6_8

Holistic Verification of Blockchain Consensus

Autori: Bertrand, Nathalie ; Gramoli, Vincent ; Konnov, Igor ; Lazić, Marijana ; Tholoniat, Pierre ; Widder, Josef
Pubblicato in: 36th International Symposium on Distributed Computing (DISC 2022), Numero 246, 2022, Pagina/e 10:1--10:24, ISBN 978-3-95977-255-6
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.disc.2022.10

Complexity of Coverability in Bounded Path Broadcast Networks

Autori: Balasubramanian, A. R.
Pubblicato in: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Numero 213, 2021, Pagina/e 35:1--35:16, ISBN 978-3-95977-215-0
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.fsttcs.2021.35

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

Autori: Raskin, Michael
Pubblicato in: The 14th European Lisp Symposium (ELS'21), Numero 4, 2021, ISSN 2677-3465
Editore: Zenodo
DOI: 10.5281/zenodo.4724166

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

Autori: A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
Pubblicato 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, Numero 12650, 2021, Pagina/e 42-61, ISBN 978-3-030-71994-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-71995-1_3

A Classification of Weak Asynchronous Models of Distributed Computing

Autori: Javier Esparza, Fabian Reiter
Pubblicato in: 31st International Conference on Concurrency Theory, CONCUR 2020, Numero 171, 2020, Pagina/e 10:1--10:16
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2020.10

Population Protocols: Beyond Runtime Analysis

Autori: Esparza, Javier
Pubblicato in: Reachability Problems - 15th International Conference, RP 2021, 2021, Pagina/e 28--51, ISBN 978-3-030-89716-1
Editore: Springer
DOI: 10.1007/978-3-030-89716-1_3

Sharp Thresholds in Random Simple Temporal Graphs

Autori: Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Pubblicato in: 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, Pagina/e 319-326, ISBN 978-1-6654-2055-6
Editore: IEEE
DOI: 10.1109/focs52979.2021.00040

Proving Noninterference in Multi-Agent Systems

Autori: Christian Müller
Pubblicato in: 2020
Editore: 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)

Autori: Martin Helfrich
Pubblicato in: 2023
Editore: Technical University of Munich

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

Autori: A.R. Balasubramanian
Pubblicato in: 2023
Editore: Technical University of Munich

Observation Petri Nets

Autori: Chana Weil-Kennedy
Pubblicato in: 2023
Editore: Technical University of Munich

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

Autori: Christoph Welzel-Mohr
Pubblicato in: 2023
Editore: Technical University of Munich

Constraint-based Analysis of Distributed Systems

Autori: Philipp Klara Johanna Meyer
Pubblicato in: 2021
Editore: Technical University of Munich

Population Protocols: Expressiveness, Succinctness and Automatic Verification

Autori: Stefan Jaax
Pubblicato in: 2020
Editore: Technical University of Munich

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

Autori: Javier Esparza, Mikhail Raskin, Christoph Welzel
Pubblicato in: Logical Methods in Computer Science, 2023, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2205.03060

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

Autori: Hans van Ditmarsch, Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum
Pubblicato in: Journal of Logical and Algebraic Methods in Programming, Numero 121, 2021, Pagina/e 100662, ISSN 2352-2208
Editore: Elsevier
DOI: 10.1016/j.jlamp.2021.100662

Parameterized verification of coverability in infinite state broadcast networks

Autori: A. R. Balasubramanian
Pubblicato in: Information and Computation, Numero Volume 278, 2021, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2020.104592

A Unified Translation of Linear Temporal Logic to ω-Automata

Autori: Javier Esparza, Jan Křetínský, Salomon Sickert
Pubblicato in: Journal of the ACM, Numero 67/6, 2020, Pagina/e 1-61, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3417995

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

Autori: Igor Konnov; Marijana Lazić; Ilina Stoilkovska; Josef Widder
Pubblicato in: Logical Methods in Computer Science, Numero Volume 19, Numero 1, 2023, Pagina/e 5:1 -- 5:37, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2011.14789

Lower bounds on the state complexity of population protocols

Autori: Philipp Czerner, Javier Esparza, Jérôme Leroux
Pubblicato in: Distributed Computing, 2023, ISSN 1432-0452
Editore: Springer
DOI: 10.1007/s00446-023-00450-4

Computing Parameterized Invariants of Parameterized Petri Nets

Autori: Javier Esparza; Mikhail Raskin; Christoph Welzel
Pubblicato in: Fundamental Informaticae, Numero 1, 2022, Pagina/e 197--243, ISSN 0169-2968
Editore: IOS Press
DOI: 10.3233/fi-222137

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

Autori: Javier Esparza, Jan Křetínský, Jean-François Raskin, Salomon Sickert
Pubblicato in: International Journal on Software Tools for Technology Transfer, Numero 24, 2022, Pagina/e 635–659, ISSN 1433-2779
Editore: Springer Verlag
DOI: 10.1007/s10009-022-00663-1

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

Autori: Javier Esparza, Rubén Rubio, Salomon Sickert
Pubblicato in: Journal of the ACM, 2023, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.48550/arxiv.2310.12613

Practical synthesis of reactive systems from LTL specifications via parity games

Autori: Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
Pubblicato in: Acta Informatica, 2019, ISSN 0001-5903
Editore: Springer Verlag
DOI: 10.1007/s00236-019-00349-3

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

Autori: Kristoffer Arnsfelt Hansen, Mikhail Raskin
Pubblicato in: Electronic Proceedings in Theoretical Computer Science, Numero 305, 2019, Pagina/e 83-90, ISSN 2075-2180
Editore: Electronic Proceedings in Theoretical Computer Science
DOI: 10.4204/eptcs.305.6

On defining linear orders by automata

Autori: Bruno Courcelle, Irène Durand, Michael Raskin
Pubblicato in: Moscow Journal of Combinatorics and Number Theory, Numero 9/3, 2020, Pagina/e 253-291, ISSN 2640-7361
Editore: Mathematical Sciences Publishers
DOI: 10.2140/moscow.2020.9.253

Affine Extensions of Integer Vector Addition Systems with States

Autori: Michael Blondin ; Christoph Haase ; Filip Mazowiecki ; Mikhail Raskin
Pubblicato in: Logical Methods in Computer Science, Numero Volume 17, Numero 3, 2021, Pagina/e 1:1–1:26, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:1)2021

Fast and Succinct Population Protocols for Presburger Arithmetic

Autori: Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza
Pubblicato in: Journal of Computer and System Sciences, 2023, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2023.103481

Towards efficient verification of population protocols

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

Certifying Inexpressibility

Autori: Orna Kupferman; Salomon Sickert
Pubblicato in: Foundations of Software Science and Computation Structures, Numero 1, 2021, Pagina/e 385--405, ISSN 0302-9743
Editore: Springer Verlag
DOI: 10.48550/arxiv.2101.08756

The complexity of verifying population protocols

Autori: Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy
Pubblicato in: Distributed Computing, Numero 34/2, 2021, Pagina/e 133-177, ISSN 0178-2770
Editore: Springer Verlag
DOI: 10.1007/s00446-021-00390-x

The Complexity of Reachability in Affine Vector Addition Systems with States

Autori: Michael Blondin ; Mikhail Raskin
Pubblicato in: Logical Methods in Computer Science, Numero Volume 17, Numero 3, 2021, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-17(3:3)2021

Protocols with constant local storage and unreliable communication

Autori: Mikhail Raskin
Pubblicato in: Theoretical Computer Science, Numero Volume 940, Part A, 2023, Pagina/e 269--282, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2022.11.006

Verification of randomized consensus algorithms under round-rigid adversaries

Autori: Nathalie Bertrand, Igor Konnov, Marijana Lazić, Josef Widder
Pubblicato in: International Journal on Software Tools for Technology Transfer, Numero 23, 2021, Pagina/e 797--821, ISSN 1433-2779
Editore: Springer Verlag
DOI: 10.1007/s10009-020-00603-x

Pubblicazioni

Condividi questa pagina

Scarica