Research output per year
Research output per year
- 1 - 50 out of 61 results
Search results
-
2025
REGULAR MODEL CHECKING UPSIDE-DOWN: AN INVARIANT-BASED APPROACH
Esparza, J., Raskin, M. & Welzel-Mohr, C., 2025, In: Logical Methods in Computer Science. 21, 1, p. 4:1-4:34Research output: Contribution to journal › Article › peer-review
Open Access -
2024
Efficient Normalization of Linear Temporal Logic
Esparza, J., Rubio, R. & Sickert, S., 10 Apr 2024, In: Journal of the ACM. 71, 2, 16.Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
Fast and succinct population protocols for Presburger arithmetic
Czerner, P., Guttenberg, R., Helfrich, M. & Esparza, J., Mar 2024, In: Journal of Computer and System Sciences. 140, 103481.Research output: Contribution to journal › Article › peer-review
Open Access5 Scopus citations -
SEPARATORS IN CONTINUOUS PETRI NETS
Blondin, M. & Esparza, J., 2024, In: Logical Methods in Computer Science. 20, 1, p. 15:1-15:24Research output: Contribution to journal › Article › peer-review
Open Access -
2023
FINDING CUT-OFFS IN LEADERLESS RENDEZ-VOUS PROTOCOLS IS EASY
Balasubramanian, A. R., Esparza, J. & Raskin, M., 2023, In: Logical Methods in Computer Science. 19, 4, p. 2:1-2:44Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
Lower bounds on the state complexity of population protocols
Czerner, P., Esparza, J. & Leroux, J., Sep 2023, In: Distributed Computing. 36, 3, p. 209-218 10 p.Research output: Contribution to journal › Article › peer-review
Open Access -
2022
Computing Parameterized Invariants of Parameterized Petri Nets
Esparza, J., Raskin, M. & Welzel, C., 2022, In: Fundamenta Informaticae. 187, 2-4, p. 197-243 47 p.Research output: Contribution to journal › Article › peer-review
Open Access -
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
Esparza, J., Křetínský, J., Raskin, J. F. & Sickert, S., Aug 2022, In: International Journal on Software Tools for Technology Transfer. 24, 4, p. 635-659 25 p.Research output: Contribution to journal › Article › peer-review
Open Access5 Scopus citations -
2021
The complexity of verifying population protocols
Esparza, J., Jaax, S., Raskin, M. & Weil-Kennedy, C., Apr 2021, In: Distributed Computing. 34, 2, p. 133-177 45 p.Research output: Contribution to journal › Article › peer-review
Open Access8 Scopus citations -
Towards efficient verification of population protocols
Blondin, M., Esparza, J., Jaax, S. & Meyer, P. J., Sep 2021, In: Formal Methods in System Design. 57, 3, p. 305-342 38 p.Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
2020
A Unified Translation of Linear Temporal Logic to ω-Automata
Esparza, J., Kretínský, J. & Sickert, S., Nov 2020, In: Journal of the ACM. 67, 6, 33.Research output: Contribution to journal › Article › peer-review
Open Access13 Scopus citations -
2019
Negotiation as concurrency primitive
Desel, J., Esparza, J. & Hoffmann, P., 11 Mar 2019, In: Acta Informatica. 56, 2, p. 93-159 67 p.Research output: Contribution to journal › Article › peer-review
Open Access3 Scopus citations -
2018
Soundness in negotiations
Esparza, J., Kuperberg, D., Muscholl, A. & Walukiewicz, I., 16 Jan 2018, In: Logical Methods in Computer Science. 14, 1, 4.Research output: Contribution to journal › Article › peer-review
3 Scopus citations -
2017
Minimizing test suites with unfoldings of multithreaded programs
Saarikivi, O., Ponce-De-León, H., Kähkönen, K., Heljanko, K. & Esparza, J., Feb 2017, In: ACM Transactions on Embedded Computing Systems. 16, 2, 45.Research output: Contribution to journal › Article › peer-review
8 Scopus citations -
Model checking parameterized asynchronous shared-memory systems
Durand-Gasselin, A., Esparza, J., Ganty, P. & Majumdar, R., 1 Jun 2017, In: Formal Methods in System Design. 50, 2-3, p. 140-167 28 p.Research output: Contribution to journal › Article › peer-review
Open Access10 Scopus citations -
Polynomial analysis algorithms for free choice Probabilistic Workflow Nets
Esparza, J., Hoffmann, P. & Saha, R., Dec 2017, In: Performance Evaluation. 117, p. 104-129 26 p.Research output: Contribution to journal › Article › peer-review
Open Access8 Scopus citations -
Verification of population protocols
Esparza, J., Ganty, P., Leroux, J. & Majumdar, R., 1 Mar 2017, In: Acta Informatica. 54, 2, p. 191-215 25 p.Research output: Contribution to journal › Article › peer-review
Open Access45 Scopus citations -
2016
Existence of home states in Petri nets is decidable
Best, E. & Esparza, J., 1 Jun 2016, In: Information Processing Letters. 116, 6, p. 423-427 5 p.Research output: Contribution to journal › Article › peer-review
18 Scopus citations -
From LTL to deterministic automata: A safraless compositional approach
Esparza, J., Křetínský, J. & Sickert, S., 1 Dec 2016, In: Formal Methods in System Design. 49, 3, p. 219-271 53 p.Research output: Contribution to journal › Article › peer-review
23 Scopus citations -
Parameterized verification of asynchronous shared-memory systems
Esparza, J., Ganty, P. & Majumdar, R., Feb 2016, In: Journal of the ACM. 63, 1, 10.Research output: Contribution to journal › Article › peer-review
Open Access22 Scopus citations -
2015
FPSOLVE: A Generic Solver for Fixpoint Equations over Semirings
Esparza, J., Luttenberger, M. & Schlund, M., 1 Nov 2015, In: International Journal of Foundations of Computer Science. 26, 7, p. 805-825 21 p.Research output: Contribution to journal › Article › peer-review
4 Scopus citations -
2014
Pattern-based verification for multithreaded programs
Esparza, J., Ganty, P. & Poch, T., 1 Aug 2014, In: ACM Transactions on Programming Languages and Systems (TOPLAS). 36, 3, 9.Research output: Contribution to journal › Article › peer-review
Open Access18 Scopus citations -
2013
Analyzing probabilistic pushdown automata
Brázdil, T., Esparza, J., Kiefer, S. & Kučera, A., Oct 2013, In: Formal Methods in System Design. 43, 2, p. 124-163 40 p.Research output: Contribution to journal › Article › peer-review
Open Access36 Scopus citations -
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
Esparza, J., Gaiser, A. & Kiefer, S., 2013, In: Information Processing Letters. 113, 10-11, p. 381-385 5 p.Research output: Contribution to journal › Article › peer-review
5 Scopus citations -
2012
Space-efficient scheduling of stochastically generated tasks
Brázdil, T., Esparza, J., Kiefer, S. & Luttenberger, M., Jan 2012, In: Information and Computation. 210, p. 87-110 24 p.Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
2011
Complexity of pattern-based verification for multithreaded programs
Esparza, J. & Ganty, P., Jan 2011, In: ACM SIGPLAN Notices. 46, 1, p. 499-510 12 p.Research output: Contribution to journal › Article › peer-review
21 Scopus citations -
Derivation tree analysis for accelerated fixed-point computation
Esparza, J., Kiefer, S. & Luttenberger, M., 20 Jun 2011, In: Theoretical Computer Science. 412, 28, p. 3226-3241 16 p.Research output: Contribution to journal › Article › peer-review
Open Access4 Scopus citations -
Learning workflow Petri nets
Esparza, J., Leucker, M. & Schlund, M., 2011, In: Fundamenta Informaticae. 113, 3-4, p. 205-228 24 p.Research output: Contribution to journal › Article › peer-review
13 Scopus citations -
Parikh's theorem: A simple and direct automaton construction
Esparza, J., Ganty, P., Kiefer, S. & Luttenberger, M., 15 Jun 2011, In: Information Processing Letters. 111, 12, p. 614-619 6 p.Research output: Contribution to journal › Article › peer-review
Open Access47 Scopus citations -
2010
Computing the least fixed point of positive polynomial systems
Esparza, J., Kiefer, S. & Luttenberger, M., 2010, In: SIAM Journal on Computing. 39, 6, p. 2282-2335 54 p.Research output: Contribution to journal › Article › peer-review
Open Access18 Scopus citations -
Newtonian program analysis
Esparza, J., Kiefer, S. & Luttenberger, M., Oct 2010, In: Journal of the ACM. 57, 6, 33.Research output: Contribution to journal › Article › peer-review
48 Scopus citations -
2008
A negative result on depth-first net unfoldings
Esparza, J., Kanade, P. & Schwoon, S., Mar 2008, In: International Journal on Software Tools for Technology Transfer. 10, 2, p. 161-166 6 p.Research output: Contribution to journal › Article › peer-review
4 Scopus citations -
On the complexity of consistency and complete state coding for signal transition graphs
Esparza, J., Janar, P. & Miller, A., 2008, In: Fundamenta Informaticae. 86, 3, p. 227-253 27 p.Research output: Contribution to journal › Article › peer-review
-
2006
Model checking probabilistic pushdown automata
Esparza, J., Kučera, A. & Mayr, R., 6 Mar 2006, In: Logical Methods in Computer Science. 2, 1, 2.Research output: Contribution to journal › Article › peer-review
Open Access57 Scopus citations -
2004
A polynomial-time algorithm for checking consistency of free-choice signal transition graphs
Esparza, J., Sep 2004, In: Fundamenta Informaticae. 62, 2, p. 197-220 24 p.Research output: Contribution to journal › Article › peer-review
5 Scopus citations -
Verifying probabilistic procedural programs
Esparza, J. & Etessami, K., 2004, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3328, p. 16-31 16 p.Research output: Contribution to journal › Article › peer-review
11 Scopus citations -
2003
A generic approach to the static analysis of concurrent programs with procedures
Bouajjani, A., Esparza, J. & Touili, T., 2003, In: International Journal of Foundations of Computer Science. 14, 4, p. 551-582 32 p.Research output: Contribution to journal › Article › peer-review
33 Scopus citations -
A generic approach to the static analysis of concurrent programs with procedures
Bouajjani, A., Esparza, J. & Touili, T., Jan 2003, In: ACM SIGPLAN Notices. 38, 1, p. 62-73 12 p.Research output: Contribution to journal › Article › peer-review
17 Scopus citations -
A Logical Viewpoint on Process-algebraic Quotients
Kučera, A. & Esparza, J., Dec 2003, In: Journal of Logic and Computation. 13, 6, p. 863-880 18 p.Research output: Contribution to journal › Article › peer-review
12 Scopus citations -
Model checking LTL with regular valuations for pushdown systems
Esparza, J., Kučera, A. & Schwoon, S., 1 Nov 2003, In: Information and Computation. 186, 2, p. 355-376 22 p.Research output: Contribution to journal › Article › peer-review
Open Access107 Scopus citations -
Synthesis of distributed algorithms using asynchronous automata
Ştefǎnescu, A., Esparza, J. & Muscholl, A., 2003, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2761, p. 27-41 15 p.Research output: Contribution to journal › Article › peer-review
29 Scopus citations -
2002
An improvement of McMillan's unfolding algorithm
Esparza, J., Römer, S. & Vogler, W., May 2002, In: Formal Methods in System Design. 20, 3, p. 285-310 26 p.Research output: Contribution to journal › Article › peer-review
226 Scopus citations -
2001
Net reductions for LTL model-checking
Esparza, J. & Schröter, C., 2001, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2144, p. 310-324 15 p.Research output: Contribution to journal › Article › peer-review
Open Access14 Scopus citations -
Unfolding based algorithms for the reachability problem
Esparza, J. & Schröter, C., Aug 2001, In: Fundamenta Informaticae. 47, 3-4, p. 231-245 15 p.Research output: Contribution to journal › Article › peer-review
23 Scopus citations -
2000
An efficient automata approach to some problems on context-free grammars
Bouajjani, A., Esparza, J., Finkel, A., Maler, O., Rossmanith, P., Willems, B. & Wolper, P., 30 Jun 2000, In: Information Processing Letters. 74, 5-6, p. 221-227 7 p.Research output: Contribution to journal › Article › peer-review
Open Access22 Scopus citations -
Verification of safety properties using integer programming: Beyond the state equation
Esparza, J. & Melzer, S., 2000, In: Formal Methods in System Design. 16, 2, p. 159-189 31 p.Research output: Contribution to journal › Article › peer-review
45 Scopus citations -
1999
Petri nets and regular processes
Jančar, P., Esparza, J. & Moller, F., Dec 1999, In: Journal of Computer and System Sciences. 59, 3, p. 476-503 28 p.Research output: Contribution to journal › Article › peer-review
Open Access27 Scopus citations -
Zeros of the Whittaker function associated to Coulomb waves
Esparza, J., López, J. L. & Sesma, J., Aug 1999, In: IMA Journal of Applied Mathematics (Institute of Mathematics and Its Applications). 63, 1, p. 71-87 17 p.Research output: Contribution to journal › Article › peer-review
2 Scopus citations -
1998
Reachability in live and safe free-choice Petri nets is NP-complete
Esparza, J., 30 May 1998, In: Theoretical Computer Science. 198, 1-2, p. 211-224 14 p.Research output: Contribution to journal › Article › peer-review
Open Access34 Scopus citations -
1997
Decidability of model checking for infinite-state concurrent systems
Esparza, J., 1997, In: Acta Informatica. 34, 2, p. 85-107 23 p.Research output: Contribution to journal › Article › peer-review
103 Scopus citations