No. Title Author Year
1 Succinct Population Protocols for Presburger Arithmetic Blondin, Michael et al. 2020
2 Expressive Power of Broadcast Consensus Protocols Blondin, Michael et al. 2019
3 Automatic Analysis of Expected Termination Time for Population Protocols Blondin, Michael et al. 2018
4 Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211) Esparza, Javier et al. 2018
5 Large Flocks of Small Birds: on the Minimal Size of Population Protocols Blondin, Michael et al. 2018
6 Verification of Immediate Observation Population Protocols Esparza, Javier et al. 2018
7 Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk) Esparza, Javier 2017
8 Model Checking Population Protocols Esparza, Javier et al. 2016
9 Soundness in Negotiations Esparza, Javier et al. 2016
10 Verification of Population Protocols Esparza, Javier et al. 2015
11 Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk) Esparza, Javier 2014
12 Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141) Esparza, Javier et al. 2014
13 Computation of Summaries Using Net Unfoldings Esparza, Javier et al. 2013
14 Computing Least Fixed Points of Probabilistic Systems of Polynomials Esparza, Javier et al. 2010
15 On the Memory Consumption of Probabilistic Pushdown Automata Brazdil, Tomas et al. 2009
16 Convergence Thresholds of Newton's Method for Monotone Polynomial Equations Esparza, Javier et al. 2008
17 Reachability analysis of multithreaded software with asynchronous communication Bouajjani, Ahmed et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 17


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