2011 - Member of Academia Europaea
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 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.
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.
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.
Free choice Petri nets
Jörg Desel;Javier Esparza.
Reachability Analysis of Pushdown Automata: Application to Model-Checking
Ahmed Bouajjani;Javier Esparza;Oded Maler.
international conference on concurrency theory (1997)
Decidability Issues for Petri Nets
Javier Esparza;Mogens Nielsen.
BRICS Report Series (1994)
Efficient Algorithms for Model Checking Pushdown Systems
Javier Esparza;David Hansel;Peter Rossmanith;Stefan Schwoon.
computer aided verification (2000)
An Improvement of McMillan's Unfolding Algorithm
Javier Esparza;Stefan Römer;Walter Vogler.
formal methods (2002)
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets (1996)
Decidability Issues for Petri Nets - a survey.
Javier Esparza;Mogens Nielsen.
Bulletin of The European Association for Theoretical Computer Science (1994)
Model checking using net unfoldings
Science of Computer Programming (1994)
On the verification of broadcast protocols
J. Esparza;A. Finkel;R. Mayr.
logic in computer science (1999)
Unfoldings: A Partial-Order Approach to Model Checking
Javier Esparza;Keijo Heljanko.
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: