Javier Esparza

Last updated
Javier Esparza
Born (1964-04-27) 27 April 1964 (age 59)
Pamplona, Spain
Awards
Scientific career
Fields
Institutions
Website www7.in.tum.de/~esparza/

Francisco Javier Esparza Estaun (born 27 April 1964 in Pamplona, Spain [1] ) is a Spanish computer scientist. He is a professor at the Technical University of Munich.

Contents

Education

Javier Esparza Estaun received his Master of Science degree in Theoretical Physics from the University of Zaragoza (1987). He earned his Doctoral degree (PhD) in Computer Science (1990, on free-choice Petri nets) from the same university. [2] [3] He habilitated 1994 at the University of Hildesheim on the subject of Petri net unfoldings. [4]

Career

During his habilitation and in the period afterwards, Javier Esparza's focus was on concurrency theory and the theory of Petri nets. He made important contributions to Petri net structure theory and to the unfolding approach, initially proposed by Kenneth L. McMillan, [5] and he is the co-author of two books on these subjects. [6] [7]

After his habilitation, he was employed as an associate professor at Technische Universität München (1994–2001). He was then successively Chair of Theoretical Computer Science at the University of Edinburgh (2001–2003) and Chair of Software Reliability and Security at the Universität Stuttgart (2003–2007). Since 2007, he holds the chair for Foundations of Software Reliability and Theoretical Computer Science, again at Technische Universität München. [1]

He has also made contributions to the automata-theoretic approach to software model checking, to program analysis, and to the verification of infinite-state systems. More recently, his work has focused on the verification of parametrised and stochastic systems. He has published over 250 peer-reviewed scientific papers [8] in the aforementioned fields, as well as a book on an algorithmic approach to automata theory (coauthored with Michael Blondin.) [9] Multiple software verification tools have been developed by his group, such as Moped [10] and jMoped, [11] Rabinizer, [12] Strix, [13] and Peregrine. [14] He received an Advanced Grant from the European Research Council in 2018 [15] and has been Principal Investigator of more than 20 research projects, most of them collaborative in an international context. [1] He has frequently been invited as a speaker at Computer Science conferences and has served as a Chair or a member of various professional Program, Steering and Selection Committees. [1]

Awards and honours

Javier Esparza has been awarded an honorary doctorate in Informatics from the Masaryk University of Brno, Czech Republic, in 2009, [16] and he is an elected member of Academia Europaea since 2011. [17] He received the CONCUR Test-of Time Award 2021 for his paper Reachability Analysis of Pushdown Automata: Application to Model-checking (co-authored with Ahmed Bouajjani and Oded Maler); [18] several best paper awards at conferences; [19] [20] [21] multiple times a Best Teaching prize at the Technische Universität München; [22] and a Dissertation Prize of Universidad de Zaragoza (1990). [23]

Related Research Articles

<span class="mw-page-title-main">Carl Adam Petri</span> German mathematician (1926–2010)

Carl Adam Petri was a German mathematician and computer scientist.

<span class="mw-page-title-main">DBLP</span> Computer science bibliography website

DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet.

<span class="mw-page-title-main">Dagstuhl</span>

Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland.

In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY. As a class it is sometimes denoted as NONELEMENTARY.

CIAA, the International Conference on Implementation and Application of Automata is an annual academic conference in the field of computer science. Its purpose is to bring together members of the academic, research, and industrial community who have an interest in the theory, implementation, and application of automata and related structures. There, the conference concerns research on all aspects of implementation and application of automata and related structures, including theoretical aspects. In 2000, the conference grew out of the Workshop on Implementation of Automata (WIA).

<span class="mw-page-title-main">Wilfried Brauer</span> German computer scientist (1937–2014)

Wilfried Brauer was a German computer scientist and professor emeritus at Technical University of Munich.

<span class="mw-page-title-main">Wil van der Aalst</span> Dutch computer scientist and professor

Willibrordus Martinus Pancratius van der Aalst is a Dutch computer scientist and full professor at RWTH Aachen University, leading the Process and Data Science (PADS) group. His research and teaching interests include information systems, workflow management, Petri nets, process mining, specification languages, and simulation. He is also known for his work on workflow patterns.

<span class="mw-page-title-main">Reinhard Wilhelm</span> German computer scientist

Reinhard Wilhelm is a German computer scientist.

Jan van Leeuwen is a Dutch computer scientist and emeritus professor of computer science at the Department of Information and Computing Sciences at Utrecht University.

Rüdiger Valk is a German mathematician. From 1976 to 2010 he was Professor for Theoretical Computer Science (Informatics) at the Institut für Informatik of the University of Hamburg, Germany.

Gunther Schmidt is a German mathematician who works also in informatics.

The International Summer School Marktoberdorf is an annual two-week summer school for international computer science and mathematics postgraduate students and other young researchers, held annually since 1970 in Marktoberdorf, near Munich in southern Germany. Students are accommodated in the boarding house of a local high school, Gymnasium Marktoberdorf. Proceedings are published when appropriate.

<span class="mw-page-title-main">Oscar H. Ibarra</span>

Oscar H. Ibarra is a Filipino-American theoretical computer scientist, prominent for work in automata theory, formal languages, design and analysis of algorithms and computational complexity theory. He was a Professor of the Department of Computer Science at the University of California-Santa Barbara until his retirement in 2011. Previously, he was on the faculties of UC Berkeley (1967-1969) and the University of Minnesota (1969-1990). He is currently a Distinguished Professor Emeritus at UCSB.

<span class="mw-page-title-main">Juhani Karhumäki</span> Finnish mathematician and theoretical computer scientist

Eero Urho Juhani Karhumäki is a Finnish mathematician and theoretical computer scientist known for his contributions to automata theory. He is a professor at the University of Turku.

Ralf Steinmetz is a German computer scientist and electrical engineer. He is professor of multimedia communication at the Technische Universität Darmstadt.

Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars.

Eike Best is a German computer scientist, best known for his contributions to concurrency theory.

<span class="mw-page-title-main">Eric Bodden</span> German computer scientist

Eric Bodden is a German computer scientist. He holds the Chair of Secure Software Engineering at the Heinz Nixdorf Institute of the Paderborn University and is Director of Software Engineering and IT Security at the Fraunhofer Institute for Mechatronic Design (IEM). He is also head of the engineering department in the Collaborative Research Centre 1119 CROSSING at the Technical University of Darmstadt.

Analysis of Petri nets can be performed by means of constructing either reachable state spaces or via the process of graph-based unfolding. The prefix of a Petri net unfolding, which is an acyclic Petri net graph, contains the same information about the properties of the Petri net as the reachability graph, plus it contains information about sequence, concurrency and conflict relations between Petri net transitions and Petri net places. The advantages of the use of unfolding in practice are typically associated with the fact that the unfolding prefix is much more compact than the reachability graph of the Petri net being analysed.

References

  1. 1 2 3 4 "Curriculum vitae" (PDF). Technische Universität München. Retrieved 2021-04-29.
  2. ↑ Esparza J., Silva M. (1991) On the analysis and synthesis of free choice systems. Lecture Notes in Computer Science, vol 483. Springer, Berlin, Heidelberg. 1991. pp. 243–286. doi:10.1007/3-540-53863-1_28. ISBN   9783540463696 . Retrieved 2021-04-29.
  3. ↑ "Citations in Google Scholar". Google Scholar. Retrieved 2021-04-29.
  4. ↑ Esparza, Javier (December 1994). "Model checking using net unfoldings". Science of Computer Programming. 23 (2): 151–195. doi: 10.1016/0167-6423(94)00019-0 . S2CID   29311587.
  5. ↑ "Kenneth L. McMillan". Wordpress. Retrieved 2021-04-30.
  6. ↑ Jörg Desel and Javier Esparza (1995), Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol. 40, Cambridge University Press, ISBN   9-780-52101945-3
  7. ↑ Javier Esparza and Keijo Heljanko (2008), Unfoldings–A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, Springer, ISBN   978-3-540-77425-9
  8. ↑ "DBLP publication list for Javier Esparza". DBLP computer science bibliography. Retrieved 2021-04-26.
  9. ↑ Esparza, Javier; Blondin, Michael (October 17, 2023). Automata Theory: An Algorithmic Approach. The MIT Press. p. 560. ISBN   9780262048637.
  10. ↑ "Moped". Universität Stuttgart. Retrieved 2021-04-30.
  11. ↑ "jMoped". doi: 10.1007/978-3-540-31980-1_35 .{{cite journal}}: Cite journal requires |journal= (help)
  12. ↑ Rabinizer. doi:10.1007/978-3-642-33386-6_7. ISBN   9783642333866 . Retrieved 2021-04-30.
  13. ↑ "Strix". Technische Universität München. Retrieved 2021-04-30.
  14. ↑ "Peregrine". Technische Universität München. Retrieved 2021-04-30.
  15. ↑ "ERC funded projects". European Research Council. Retrieved 2021-04-26.
  16. ↑ "Javier Esparza–Honorary Doctorates conferred by MU". Masaryk University. Retrieved 2021-04-26.
  17. ↑ "Javier Esparza". Academia Europaea. Retrieved 2021-04-26.
  18. ↑ "Concur Test of Time Awards". Qonfest conference website. Retrieved 2021-04-26.
  19. ↑ "Best paper award Petri Nets". PaVeS website. Retrieved 2021-04-26.
  20. ↑ "Best paper award Petri Nets". PaVeS website. Retrieved 2023-05-20.
  21. ↑ "Best paper award for Paves at SAND'22". PaVeS website. Retrieved 2023-05-20.
  22. ↑ "TechInf Award (Informatik)". Fachschaft Mathematik, Physik, Informatik der TUM. Retrieved 2021-04-26.
  23. ↑ "Javier Esparza - Curriculum Vitae". Academia Europaea. Retrieved 2021-04-26.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.