| No. |
Title |
Author |
Year |
| 1 |
Fast and Succinct Population Protocols for Presburger Arithmetic |
Czerner, Philipp et al. |
2022 |
| 2 |
Regular Model Checking Upside-Down: An Invariant-Based Approach |
Esparza, Javier et al. |
2022 |
| 3 |
Enforcing ω-Regular Properties in Markov Chains by Restarting |
Esparza, Javier et al. |
2021 |
| 4 |
State Complexity of Population Protocols (Invited Talk) |
Esparza, Javier |
2021 |
| 5 |
Verification of Infinite-state Systems (Dagstuhl Seminar 00141) |
Bouajjani, Ahmed et al. |
2021 |
| 6 |
A Classification of Weak Asynchronous Models of Distributed Computing |
Esparza, Javier et al. |
2020 |
| 7 |
Flatness and Complexity of Immediate Observation Petri Nets |
Raskin, Mikhail et al. |
2020 |
| 8 |
Front Matter, Table of Contents, Preface, Conference Organization |
Esparza, Javier et al. |
2020 |
| 9 |
LIPIcs, Volume 170, MFCS 2020, Complete Volume |
Esparza, Javier et al. |
2020 |
| 10 |
Succinct Population Protocols for Presburger Arithmetic |
Blondin, Michael et al. |
2020 |
| 11 |
Expressive Power of Broadcast Consensus Protocols |
Blondin, Michael et al. |
2019 |
| 12 |
Automatic Analysis of Expected Termination Time for Population Protocols |
Blondin, Michael et al. |
2018 |
| 13 |
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211) |
Esparza, Javier et al. |
2018 |
| 14 |
Large Flocks of Small Birds: on the Minimal Size of Population Protocols |
Blondin, Michael et al. |
2018 |
| 15 |
Verification of Immediate Observation Population Protocols |
Esparza, Javier et al. |
2018 |
| 16 |
Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk) |
Esparza, Javier |
2017 |
| 17 |
Model Checking Population Protocols |
Esparza, Javier et al. |
2016 |
| 18 |
Soundness in Negotiations |
Esparza, Javier et al. |
2016 |
| 19 |
Verification of Population Protocols |
Esparza, Javier et al. |
2015 |
| 20 |
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk) |
Esparza, Javier |
2014 |
| 21 |
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141) |
Esparza, Javier et al. |
2014 |
| 22 |
Computation of Summaries Using Net Unfoldings |
Esparza, Javier et al. |
2013 |
| 23 |
Computing Least Fixed Points of Probabilistic Systems of Polynomials |
Esparza, Javier et al. |
2010 |
| 24 |
On the Memory Consumption of Probabilistic Pushdown Automata |
Brazdil, Tomas et al. |
2009 |
| 25 |
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations |
Esparza, Javier et al. |
2008 |
| 26 |
Reachability analysis of multithreaded software with asynchronous communication |
Bouajjani, Ahmed et al. |
2006 |
