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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI