Javier Esparza | Academic Influence

Javier Esparza's AcademicInfluence.com Rankings

Javier Esparza

Computer Science

#3572

World Rank

#3752

Historical Rank

Database

#4141

World Rank

#4307

Historical Rank

computer-science Degrees

Javier Esparza

Physics

#5907

World Rank

#7799

Historical Rank

physics Degrees

Download Badge

Computer Science
Physics

Javier Esparza's Degrees

PhD Theoretical Physics University of Seville
PhD Computer Science Technical University of Munich

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2026

Why Is Javier Esparza Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Francisco Javier Esparza Estaun is a Spanish computer scientist. He is a professor at the Technische Universität München. Education Javier Esparza Estaun received his Master of Science degree in Theoretical Physics from the University of Zaragoza . He earned his Doctoral degree in Computer Science from the same university. He habilitated 1994 at the University of Hildesheim on the subject of Petri net unfoldings.

(See a Problem?)

Javier Esparza's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Free choice Petri nets (1995) (888)
Reachability Analysis of Pushdown Automata: Application to Model-Checking (1997) (683)
An Improvement of McMillan's Unfolding Algorithm (1996) (460)
Efficient Algorithms for Model Checking Pushdown Systems (2000) (384)
Decidability and Complexity of Petri Net Problems - An Introduction (1996) (362)
Decidability Issues for Petri Nets - a survey (1994) (333)
On the verification of broadcast protocols (1999) (287)
Model Checking Using Net Unfoldings (1993) (260)
Unfoldings - A Partial-Order Approach to Model Checking (2008) (243)
Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) (2005) (199)
Complexity Results for 1-Safe Nets (1993) (194)
A BDD-Based Model Checker for Recursive Programs (2001) (177)
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes (1995) (175)
Model checking probabilistic pushdown automata (2004) (170)
A generic approach to the static analysis of concurrent programs with procedures (2003) (167)
Decidability of model checking for infinite-state concurrent systems (1997) (160)
A Note on On-the-Fly Verification Algorithms (2005) (146)
Model-Checking LTL with Regular Valuations for Pushdown Systems (2001) (128)
Decidability Issues for Petri Nets (1994) (112)
Circuits, handles, bridges and nets (1991) (110)
Verifying Probabilistic Procedural Programs (2004) (108)
Tools and Algorithms for the Construction and Analysis of Systems (2010) (100)
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis (1999) (93)
On the Decidability of Model Checking for Several µ-calculi and Petri Nets (1994) (91)
Limit-Deterministic Büchi Automata for Linear Temporal Logic (2016) (85)
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs (2000) (85)
A Fully Verified Executable LTL Model Checker (2013) (85)
Implementing LTL model checking with net unfoldings (2001) (82)
An Unfolding Algorithm for Synchronous Products of Transition Systems (1999) (77)
On the analysis and synthesis of free choice systems (1991) (75)
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems (2006) (66)
Application and Theory of Petri Nets 2002 (2002) (66)
From LTL to Deterministic Automata: A Safraless Compositional Approach (2014) (65)
More infinite results (2001) (64)
Quantitative analysis of probabilistic pushdown automata: expectations and variances (2005) (64)
Constraint-Based Analysis of Broadcast Protocols (1999) (63)
Verification of population protocols (2017) (62)
Verification of Safety Properties Using Integer Programming: Beyond the State Equation (2000) (62)
Reachability Analysis of Multithreaded Software with Asynchronous Communication (2005) (61)
Parameterized Verification of Asynchronous Shared-Memory Systems (2013) (60)
An SMT-Based Approach to Coverability Analysis (2014) (60)
Top-down synthesis of live and bounded free choice nets (1990) (59)
General Refinement and Recursion Operators for the Petri Box Calculus (1993) (59)
A New Unfolding Approach to LTL Model Checking (2000) (58)
Deterministic Automata for the (F,G)-fragment of LTL (2012) (57)
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets (1994) (56)
The mathematics of Petri Nets (1990) (56)
Proving Termination of Probabilistic Programs Using Patterns (2012) (53)
Model checking LTL with regular valuations for pushdown systems (2001) (53)
Parikhʼs theorem: A simple and direct automaton construction (2010) (52)
Newtonian program analysis (2010) (52)
Synthesis Rules for Petri Nets, and How they Lead to New Results (1990) (50)
Synthesis of Distributed Algorithms Using Asynchronous Automata (2003) (49)
Deciding Finiteness of Petri Nets Up To Bisimulation (1996) (48)
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets (1992) (45)
The Model-Checking Kit (2003) (44)
Symbolic Context-Bounded Analysis of Multithreaded Java Programs (2008) (44)
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete (1998) (43)
jMoped: A Java Bytecode Checker Based on Moped (2005) (41)
Unfolding Based Algorithms for the Reachability Problem (2001) (41)
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes (1995) (41)
Checking System Properties via Integer Programming (1996) (40)
Petri Nets and Regular Processes (1999) (39)
A polynomial algorithm to compute the concurrency relation of free-choice Signal Transition Graphs (1995) (39)
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata (2017) (39)
Reachability in Cyclic Extended Free-Choice Systems (1993) (37)
On the convergence of Newton's method for monotone systems of polynomial equations (2007) (37)
Complexity of pattern-based verification for multithreaded programs (2011) (36)
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk) (2014) (34)
Analyzing probabilistic pushdown automata (2013) (34)
On Fixed Point Equations over Commutative Semirings (2007) (33)
Operational Semantics for the Petri Box Calculus (1994) (33)
An efficient automata approach to some problems on context-free grammars (2000) (33)
Rabinizer: Small Deterministic Automata for LTL(F, G) (2012) (29)
Learning Workflow Petri Nets (2010) (29)
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata (2018) (28)
Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion (2005) (28)
A Perfect Model for Bounded Verification (2012) (27)
Model Checking LTL Using Constraint Programming (1997) (27)
Net Reductions for LTL Model-Checking (2001) (26)
Traps Characterize Home States in Free Choice Systems (1992) (26)
Trapping Mutual Exclusion in the Box Calculus (1996) (25)
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains (2006) (25)
Reachability in Reversible Free Choice Systems (1991) (25)
Reduction Rules for Colored Workflow Nets (2016) (25)
Model checking parameterized asynchronous shared-memory systems (2015) (24)
Grammars as Processes (2002) (24)
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL (2000) (23)
Verifying Red-Black Trees (2005) (23)
A Brief History of Strahler Numbers (2014) (23)
Model Checking of Persistent Petri Nets (1991) (23)
Large Flocks of Small Birds: on the Minimal Size of Population Protocols (2018) (22)
jMoped: A Test Environment for Java Programs (2007) (22)
Rewriting Models of Boolean Programs (2006) (22)
Computing the Least Fixed Point of Positive Polynomial Systems (2010) (22)
A Uniform Framework for Problems on Context-Free Grammars (2000) (22)
Reachability Analysis of Synchronized PA Systems (2005) (21)
Proof-Checking Protocols Using Bisimulations (1999) (21)
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (2008) (20)
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version) (2014) (20)
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations (2008) (20)
Compositional Synthesis of Live and Bounded Free Choice Petri Nets (1991) (19)
From LTL to deterministic automata (2014) (19)
An Effective Tableau System for the Linear Time µ-Calculus (1996) (18)
Computing Least Fixed Points of Probabilistic Systems of Polynomials (2009) (18)
Polynomial analysis algorithms for free choice Probabilistic Workflow Nets (2016) (18)
Minimal deadlocks in free choice nets (1989) (18)
Model Checking Procedural Programs (2018) (18)
Shortest Paths in Reachability Graphs (1993) (17)
Verification of Graph Transformation Systems with Context-Free Specifications (2010) (17)
Model Checking Population Protocols (2016) (17)
Pattern-Based Verification for Multithreaded Programs (2014) (17)
More Innnite Results (1996) (16)
An Extension of Newton ’ s Method to ω-Continuous Semirings ? (2007) (15)
Existence of home states in Petri nets is decidable (2016) (15)
A Logical Viewpoint on Process-Algebraic Quotients (1999) (15)
Parameterized Analysis of Immediate Observation Petri Nets (2019) (15)
Succinct Population Protocols for Presburger Arithmetic (2019) (15)
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations (2014) (13)
Towards efficient verification of population protocols (2017) (13)
Structural Invariants for the Verification of Systems with Parameterized Architectures (2020) (13)
Peregrine: A Tool for the Analysis of Population Protocols (2018) (13)
Separability in Conflict-Free Petri Nets (2006) (13)
A polynomial-time algorithm for checking consistency of free-choice signal transition graphs (2003) (12)
A negative result on depth-first net unfoldings (2008) (12)
Solving Fixed-Point Equations by Derivation Tree Analysis (2011) (12)
Reachability Analysis Using Net Unfoldings (2000) (11)
A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming (1992) (11)
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols (2006) (11)
FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings (2014) (11)
Parameterized Verification of Crowds of Anonymous Processes (2016) (10)
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata (2020) (9)
The complexity of verifying population protocols (2019) (9)
Negotiation as concurrency primitive (2013) (9)
Newton ’ s Method for ω-Continuous Semirings ⋆ (2008) (9)
Unfolding Based Minimal Test Suites for Testing Multithreaded Programs (2015) (8)
Newton's Method for omega-Continuous Semirings (2008) (8)
An Extension of Newton's Method to omega -Continuous Semirings (2007) (8)
Derivation tree analysis for accelerated fixed-point computation (2008) (8)
Verification of Immediate Observation Population Protocols (2018) (8)
A False History of True Concurrency: From Petri to Tools (2010) (8)
Minimizing Test Suites with Unfoldings of Multithreaded Programs (2017) (7)
Negotiation as concurrency primitive (2013) (7)
Locality-Based Abstractions (2005) (7)
An Automata Approach to Some Problems on Context-Free Grammars (1997) (7)
Automatic Analysis of Expected Termination Time for Population Protocols (2018) (7)
Space-efficient scheduling of stochastically generated tasks (2010) (7)
Negotiations and Petri Nets (2015) (7)
Verification Using PEP (1996) (7)
Probabilistic Abstractions with Arbitrary Domains (2011) (7)
Complexity of Verification and Synthesis of Threshold Automata (2020) (7)
General Refinement and Recursion for the Box Calculus: (Hildesheimer Informatik-Bericht 26/92) (1992) (7)
Simple Representative Instantiations for Multicast Protocols (2003) (6)
Verification of Systems with an Infinite State Space (2000) (6)
An Automata-Theoretic Approach to Software Verification (2003) (6)
SDSIrep: A Reputation System Based on SDSI (2008) (6)
Expressive Power of Broadcast Consensus Protocols (2019) (6)
Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs (2000) (6)
Finite and Algorithmic Model Theory (2011) (6)
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling (2020) (6)
Parikh's Theorem: A simple and direct construction (2010) (6)
Black Ninjas in the Dark: Formal Analysis of Population Protocols (2018) (5)
Lower Bounds on the State Complexity of Population Protocols (2021) (5)
On the Memory Consumption of Probabilistic Pushdown Automata (2009) (5)
Computing the Expected Execution Time of Probabilistic Workflow Nets (2018) (5)
Static analysis of deterministic negotiations (2017) (5)
Solving Monotone Polynomial Equations (2008) (5)
An SMT-based approach to fair termination analysis (2015) (5)
Quantitative Implementation Strategies for Safety Controllers (2017) (4)
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs (2006) (4)
Fast and Succinct Population Protocols for Presburger Arithmetic (2022) (4)
Automata, Languages, and Programming (2014) (4)
Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings (2012) (4)
Computation of Summaries Using Net Unfoldings (2013) (4)
Traps, Free Choice and Home States (1990) (4)
Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs (2020) (3)
Constraint-based Analysis of Broad astProto (1999) (3)
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (2013) (3)
Computing Parameterized Invariants of Parameterized Petri Nets (2021) (3)
Free Choice Petri Nets: Home markings (1995) (3)
Distributed Markov Chains (2014) (3)
Soundness in negotiations (2016) (3)
Preservation of Liveness and Deadlock-Freeness in Synchronous Synthesis of Petri Net Systems (2004) (2)
An Efficient Automata Approach to Some . . . (2000) (2)
Efficient algorithms for alternating pushdown systems : application to certificate chain discovery with threshold subjects (2006) (2)
Abduction of trap invariants in parameterized systems (2021) (2)
FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems (2009) (2)
Advances in Parameterized Verification of Population Protocols (2017) (2)
A Classification of Weak Asynchronous Models of Distributed Computing (2020) (2)
The Asynchronous Committee Meeting Problem (1993) (2)
Computing the concurrency threshold of sound free-choice workflow nets (2018) (2)
Verification of Infinite-state Systems (2000) (2)
Online Monitoring ω-Regular Properties in Unknown Markov Chains (2020) (2)
Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness (2009) (2)
Flatness and Complexity of Immediate Observation Petri Nets (2020) (2)
On the Mechanized Verification of Infinite Systems (2007) (1)
History of Strahler Numbers — with a Preface (2016) (1)
Fast and Accurate Unlexicalized Parsing via Structural Annotations (2014) (1)
A New Unfolding Approa h to LTL ModelChe king ? (2000) (1)
Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk) (2017) (1)
The Rank Theorem (1995) (1)
Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002, Proceedings (2002) (1)
Decidability Issues for Petri Nets { a Survey 1 (1994) (1)
Message-Passing Algorithms for the Verification of Distributed Protocols (2014) (1)
Negotiation Programs (2015) (1)
Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification (2015) (1)
Enforcing ω-Regular Properties in Markov Chains by Restarting (2021) (1)
Analysis techniques for Petri nets (1995) (1)
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata (2022) (1)
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy (2020) (1)
Automated Technology for Verification and Analysis: 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings (2019) (1)
Building a Software Model-Checker (2006) (1)
jMoped: A Test Environment for Java Programs (Tool Paper) (2007) (1)
Expressive Power of Oblivious Consensus Protocols (2019) (1)
Free Choice Petri Nets: Reachability and shortest sequences (1995) (0)
Distributed Markov Chains ( corrected version ) (2014) (0)
More on the Executability Problem (2008) (0)
The PEP Veri cation System 1 (1997) (0)
Model Checking Probabilistic PushdownAutomataJavier (2004) (0)
Syddansk Universitet The Paths to Choreography Extraction (2018) (0)
Automata-Theoretic Verification (2011) (0)
Free Choice Petri Nets: Reduction and synthesis (1995) (0)
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211) (2018) (0)
Polynomial Analysis Algorithms for Free-Choice Workflow Nets: Invited Talk at the Fifth International Workshop on Verification and Program Transformation (2017) (0)
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (2020) (0)
Free Choice Petri Nets: Introduction (1995) (0)
State Complexity of Population Protocols (2022) (0)
Transition Systems and Products (2008) (0)
Stochastic Process Creation (2009) (0)
– Formal Methods and Fault-Tolerant Distributed Comp . : Forging an Alliance 2 Table of Contents (2018) (0)
The Coverability Theorems (1995) (0)
From LTL to deterministic automata (2016) (0)
Free Choice Petri Nets: S-systems and T-systems (1995) (0)
An Algebraic Approach to the Static Analysis of Concurrent Software (2002) (0)
Solving Fixed-Point Equations on omega-Continuous Semirings (2009) (0)
A Simple Rewrite System for the Normalization of Linear Temporal Logic (2023) (0)
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata (2022) (0)
Decision Power of Weak Asynchronous Models of Distributed Computing (2021) (0)
Preface for the special issue GandALF 2015 (2018) (0)
On least fixed points of systems of positive polynomials (2010) (0)
Model checking parameterized asynchronous shared-memory systems (2016) (0)
The 2021 Alonzo Church award for outstanding contributions to logic and computation (2021) (0)
Model checking (with) declarative programs (2001) (0)
Verification of Infinite-state Systems (Dagstuhl Seminar 00141) (2021) (0)
Back to the Future: A Fresh Look at Linear Temporal Logic (2021) (0)
Three Case Studies on Verification of Infinite-State Systems (2012) (0)
Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets (2002) (0)
Summary, Applications, Extensions, and Tools (2008) (0)
State Complexity of Population Protocols (Invited Talk) (2021) (0)
Separators in Continuous Petri Nets (2022) (0)
Coffee and Cigarettes (2019) (0)
AndrewM. Pitts 2019 Alonzo Church Award Recipients (2019) (0)
Population Protocols: Beyond Runtime Analysis (2021) (0)
Negotiation Games (with abstract) (2014) (0)
Geometry of Reachability sets of Vector Addition Systems (2022) (0)
University of Southern Denmark The Paths to Choreography Extraction (2018) (0)
Finite and Algorithmic Model Theory: Preface (2011) (0)
LIPIcs, Volume 170, MFCS 2020, Complete Volume (2020) (0)
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141) (2014) (0)
Deterministic Negotiations: Concurrency for Free (2014) (0)
Finite and Algorithmic Model Theory: Bibliography (2011) (0)
Free Choice Petri Nets: Liveness in free-choice systems (1995) (0)
Search Procedures for the Livelock Problem (2008) (0)
List of main results (1995) (0)
Analyzing probabilistic pushdown automata (2012) (0)
Verification of population protocols (2016) (0)
Online Monitoring $\omega$-Regular Properties in Unknown Markov Chains (2020) (0)
Regular Model Checking Upside-Down: An Invariant-Based Approach (2022) (0)
Search Procedures for the Executability Problem (2008) (0)
Newtonian Program Analysis - An Introduction (2010) (0)
Model Checking LTL (2008) (0)
Alonzo Church Award 2018 - Call for Nominations (2018) (0)
Search Procedures for the Repeated Executability Problem (2008) (0)
Call for papers S t a t i c A n a l y s i s S y m p o s i u m - S A S 2 0 0 8 (2008) (0)
Toward an Efficient Methodology for the Analysis of Fault-Tolerant Systems (2009) (0)
Regular Expression Search in Compressed Text Extended Abstract (2018) (0)
Integration von PNML in das Model Checking Kit (2004) (0)
Free Choice Petri Nets: Preface (1995) (0)
Examining robotic systems with shape-adjustable manipulators under dynamic environments: From simulation to verification (2009) (0)
Analysis of Systems with Stochastic Process Creation (2010) (0)
Free Choice Petri Nets: Generalizations (1995) (0)
Strategy Iteration on the Graphics Card (2013) (0)
Stochastic Branching Processes: A Computer Science Perspective: Invited Presentation at the First Symposium on Games, Automata, Logic, and Formal Verification (2010) (0)
Black-box Testing Liveness Properties of Partially Observable Stochastic Systems (2023) (0)

This paper list is powered by the following services:

Other Resources About Javier Esparza

en.wikipedia.org

What Schools Are Affiliated With Javier Esparza?

Javier Esparza is affiliated with the following schools: