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.
