Free choice Petri nets J Desel, J Esparza Cambridge university press, 2005 | 1394* | 2005 |
Reachability analysis of pushdown automata: Application to model-checking A Bouajjani, J Esparza, O Maler CONCUR'97: Concurrency Theory: 8th International Conference Warsaw, Poland …, 1997 | 899 | 1997 |
An improvement of McMillan's unfolding algorithm J Esparza, S Römer, W Vogler Formal Methods in System Design 20, 285-310, 2002 | 751* | 2002 |
Decidability issues for Petri nets J Esparza, M Nielsen Petri nets newsletter 94, 5-23, 1994 | 601 | 1994 |
Decidability and complexity of Petri net problems—an introduction J Esparza Advanced Course on Petri Nets, 374-428, 1996 | 494 | 1996 |
Efficient algorithms for model checking pushdown systems J Esparza, D Hansel, P Rossmanith, S Schwoon International Conference on Computer Aided Verification, 232-247, 2000 | 490 | 2000 |
Model checking using net unfoldings J Esparza Science of Computer Programming 23 (2-3), 151-195, 1994 | 371 | 1994 |
On the verification of broadcast protocols J Esparza, A Finkel, R Mayr Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 361 | 1999 |
Unfoldings: a partial-order approach to model checking J Esparza, K Heljanko Springer Science & Business Media, 2008 | 320 | 2008 |
Complexity results for 1-safe nets A Cheng, J Esparza, J Palsberg Theoretical Computer Science 147 (1-2), 117-136, 1995 | 289 | 1995 |
Petri nets, commutative context-free grammars, and basic parallel processes J Esparza Fundamenta Informaticae 31 (1), 13-25, 1997 | 233 | 1997 |
Model checking LTL with regular valuations for pushdown systems J Esparza, A Kučera, S Schwoon Information and Computation 186 (2), 355-376, 2003 | 226 | 2003 |
Decidability of model checking for infinite-state concurrent systems J Esparza Acta Informatica 34 (2), 85-107, 1997 | 225 | 1997 |
A BDD-based model checker for recursive programs J Esparza, S Schwoon Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001 | 213 | 2001 |
Model checking probabilistic pushdown automata J Esparza, A Kucera, R Mayr Logical Methods in Computer Science 2, 2006 | 210 | 2006 |
A generic approach to the static analysis of concurrent programs with procedures A Bouajjani, J Esparza, T Touili ACM SIGPLAN Notices 38 (1), 62-73, 2003 | 202 | 2003 |
A note on on-the-fly verification algorithms S Schwoon, J Esparza International Conference on Tools and Algorithms for the Construction and …, 2005 | 182 | 2005 |
On the decidability of model checking for several μ-calculi and Petri nets J Esparza Colloquium on Trees in Algebra and Programming, 115-129, 1994 | 145 | 1994 |
Limit-deterministic Büchi automata for linear temporal logic S Sickert, J Esparza, S Jaax, J Křetínský International Conference on Computer Aided Verification, 312-332, 2016 | 138 | 2016 |
A fully verified executable LTL model checker J Esparza, P Lammich, R Neumann, T Nipkow, A Schimpf, JG Smaus Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013 | 136 | 2013 |