D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 54 Citations 12,753 290 World Ranking 2996 National Ranking 132

Research.com Recognitions

Awards & Achievements

2011 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Operating system

His scientific interests lie mostly in Theoretical computer science, Petri net, Model checking, Decidability and Stochastic Petri net. His study ties his expertise on Dataflow together with the subject of Theoretical computer science. The subject of his Petri net research is within the realm of Algorithm.

The Model checking study combines topics in areas such as Discrete mathematics, Concurrency, Temporal logic and Linear temporal logic. His Decidability research incorporates themes from Formal verification and Artificial intelligence. He interconnects PSPACE, Rule of thumb and Computation tree logic in the investigation of issues within Stochastic Petri net.

His most cited work include:

  • Reachability Analysis of Pushdown Automata: Application to Model-Checking (624 citations)
  • Free choice Petri nets (609 citations)
  • Efficient Algorithms for Model Checking Pushdown Systems (338 citations)

What are the main themes of his work throughout his whole career to date?

His main research concerns Theoretical computer science, Petri net, Discrete mathematics, Model checking and Algorithm. His Theoretical computer science research includes elements of Programming language and Concurrency. His Petri net research includes themes of Liveness and Set.

His work in Discrete mathematics addresses issues such as Automaton, which are connected to fields such as Linear temporal logic and Translation. His Model checking study frequently draws connections between related disciplines such as Temporal logic. While the research belongs to areas of Algorithm, Javier Esparza spends his time largely on the problem of Probabilistic logic, intersecting his research to questions surrounding Pushdown automaton.

He most often published in these fields:

  • Theoretical computer science (43.89%)
  • Petri net (29.15%)
  • Discrete mathematics (27.27%)

What were the highlights of his more recent work (between 2017-2021)?

  • Theoretical computer science (43.89%)
  • Petri net (29.15%)
  • Discrete mathematics (27.27%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Theoretical computer science, Petri net, Discrete mathematics, Reachability problem and Computation. His work in Reachability and Liveness are all subfields of Theoretical computer science research. His study connects Model checking and Reachability.

His work on Probabilistic logic expands to the thematically related Petri net. His Discrete mathematics study incorporates themes from Simple and Exponential function. His Reachability problem study is concerned with Decidability in general.

Between 2017 and 2021, his most popular works were:

  • Model Checking Procedural Programs (12 citations)
  • One Theorem to Rule Them All: A Unified Translation of LTL into {\omega}-Automata (12 citations)
  • One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata (11 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Operating system

His primary areas of study are Theoretical computer science, Discrete mathematics, Computation, Presburger arithmetic and Exponential function. His work carried out in the field of Theoretical computer science brings together such families of science as Model of computation and Petri net. His Petri net research is multidisciplinary, relying on both PSPACE, Satisfiability modulo theories, Scheduling and Infinite set.

His Discrete mathematics research is multidisciplinary, incorporating perspectives in Logarithm, Parameterized complexity and Predicate. His Reachability problem research is multidisciplinary, incorporating elements of Structure, Model checking, Predicate and Automatic summarization. His Reachability research integrates issues from Population protocol, Liveness, Correctness and Set.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Free choice Petri nets

Jörg Desel;Javier Esparza.
(1995)

1300 Citations

Reachability Analysis of Pushdown Automata: Application to Model-Checking

Ahmed Bouajjani;Javier Esparza;Oded Maler.
international conference on concurrency theory (1997)

852 Citations

Decidability Issues for Petri Nets

Javier Esparza;Mogens Nielsen.
BRICS Report Series (1994)

551 Citations

Efficient Algorithms for Model Checking Pushdown Systems

Javier Esparza;David Hansel;Peter Rossmanith;Stefan Schwoon.
computer aided verification (2000)

463 Citations

Decidability and Complexity of Petri Net Problems - An Introduction

Javier Esparza.
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets (1996)

446 Citations

An Improvement of McMillan's Unfolding Algorithm

Javier Esparza;Stefan Römer;Walter Vogler.
formal methods (2002)

433 Citations

Decidability Issues for Petri Nets - a survey.

Javier Esparza;Mogens Nielsen.
Bulletin of The European Association for Theoretical Computer Science (1994)

407 Citations

Model checking using net unfoldings

Javier Esparza.
Science of Computer Programming (1994)

340 Citations

On the verification of broadcast protocols

J. Esparza;A. Finkel;R. Mayr.
logic in computer science (1999)

339 Citations

Decidability and complexity of Petri net problems : An introduction

J. Esparza.
Lecture Notes in Computer Science (1998)

290 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Javier Esparza

Parosh Aziz Abdulla

Parosh Aziz Abdulla

Uppsala University

Publications: 74

Wil M. P. van der Aalst

Wil M. P. van der Aalst

RWTH Aachen University

Publications: 63

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 55

Ahmed Bouajjani

Ahmed Bouajjani

Université Paris Cité

Publications: 53

Antonín Kučera

Antonín Kučera

Masaryk University

Publications: 46

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 40

Mihalis Yannakakis

Mihalis Yannakakis

Columbia University

Publications: 39

Oscar H. Ibarra

Oscar H. Ibarra

University of California, Santa Barbara

Publications: 32

Jan Mendling

Jan Mendling

Humboldt-Universität zu Berlin

Publications: 28

P. Madhusudan

P. Madhusudan

University of Illinois at Urbana-Champaign

Publications: 28

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 27

Manuel Silva

Manuel Silva

University of Zaragoza

Publications: 27

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 26

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 26

Wil van der Aalst

Wil van der Aalst

RWTH Aachen University

Publications: 26

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 25

Trending Scientists

Francis Kramarz

Francis Kramarz

École Nationale de la Statistique et de l'Administration Économique

Christophe Clanet

Christophe Clanet

École Polytechnique

Robert J. Farrauto

Robert J. Farrauto

Columbia University

Gordon L. Graff

Gordon L. Graff

Pacific Northwest National Laboratory

Hirotomo Nishihara

Hirotomo Nishihara

Tohoku University

Hansu Kim

Hansu Kim

Hanyang University

Michael C. Holmes

Michael C. Holmes

Ambys Medicines

Brian J. McGill

Brian J. McGill

University of Maine

Bernard A. Chouet

Bernard A. Chouet

United States Geological Survey

John S. Pallister

John S. Pallister

United States Geological Survey

Christoph C. Raible

Christoph C. Raible

University of Bern

Lance Wallace

Lance Wallace

Environmental Protection Agency

Juha Silvanto

Juha Silvanto

University of Surrey

Patrick Luyten

Patrick Luyten

KU Leuven

Robert A. Lew

Robert A. Lew

Boston University

Mathew S. Maurer

Mathew S. Maurer

Columbia University

Something went wrong. Please try again later.