Esparza, J.

• Esparza, Javier:
  A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. 2003.

• Schröter, Claus; Schwoon, Stefan; Esparza, Javier:
  The Model-Checking Kit. 2003.

• Esparza, Javier; Schröter, Claus:
  Net Reductions for LTL Model-Checking. 2001.

• Esparza, J.; Heljanko, K.:
  A new unfolding approach to LTL model checking. 2000.

• Schröter, C.; Esparza, J.:
  Reachability analysis using net unfoldings. 2000.

• Esparza, Javier; Römer, Stefan:
  An Unfolding Algorithm for Synchronous Products of Transition Systems. 1999.

• Esparza, Javier:
  Decidability and Complexity of Petri Net Problems - An Introduction. 1998.

• Esparza, Javier; Melzer, Stephan:
  Model Checking LTL Using Constraint Programming. 1997.

• Esparza, Javier; Bruns, Glenn:
  Trapping mutual exclusion in the box calculus. 1996.

• Jancar, Petr; Esparza, Javier:
  Deciding Finiteness of Petri Nets Up To Bisimulation. 1996.

• Melzer, S.; Römer, S.; Esparza, J.:
  Verification using PEP. 1996.

• Esparza, Javier; Römer, Stefan; Vogler, Walter:
  An Improvement of McMillan's Unfolding Algorithm. 1996.

• Desel, Jörg; Esparza, Javier:
  Free Choice Petri nets. 1995.

• Melzer, Stephan; Esparza, Javier:
  Verifikation von Systemeigenschaften mittelnb gemischt-ganzzahliger Programmierung. 1995.

• Esparza, Javier:
  On the Decidability of Model Checking for Several µ-calculi and Petri Nets. 1994.

• Esparza, J.:
  Reduction and synthesis of live and bounded free-choice Petri nets. 1994.

• Esparza, Javier; Nielsen, Mogens:
  Decidability Issues for Petri Nets. 1994.

• Best, Eike; Devillers, Raymond; Esparza, Javier:
  General Refinement and Recursion Operators for the Petri Box Calculus. 1993.

• Cheng, A.; Esparza, J.; Palsberg, J.:
  Complexity Results for 1-Safe Nets. 1993.

• Desel, J.; Esparza, J.:
  Reachability in cyclic extended free-choice systems. 1993.

• Desel, J.; Esparza, J.:
  Shortest Paths in Reachability Graphs. 1993.

• Desel, Jörg; Esparza, Javier:
  Structure theory of free choice systems. 1993.

• Esparza, J.:
  Model checking using net unfoldings. 1993.

• Esparza, Javier; von Stengel, Bernhard:
  The Asynchronous Committee Meeting Problem. 1993.

• Best, E.; Desel, J.; Esparza, J.:
  Traps characterize home states in free choice systems. 1992.

• Esparza, J.:
  A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming. 1992.

• Desel, Jörg; Esparza, Javier:
  Reachability in Reversible Free Choice Systems. 1991.

• Esparza, J.; Silva, M.:
  Compositional Synthesis of Live and bounded Free Choice Petri Nets. 1991.

• Esparza, J.; Silva, M.:
  On the analysis and synthesis of free choice systems. 1991.

• Esparza, Javier; Silva, Manuel:
  On the Analysis and Synthesis of Free Choice Systems. 1991.

• Best, Eike; Esparza, Javier:
  Model Checking of Persistent Petri Nets. 1991.

• Best, E.; Esparza, J.:
  Design Methods Based on Nets (DEMON): Edited Progress Report of the Esprit Basic Research Action 3148. 1991.

• Esparza, Javier:
  A Polynomial Time Algorithm to Solve the Covering Problem for 1-Bounded Conflict-Free Petri Nets. 1991.

• Esparza, J.:
  Reduction and Synthesis of Live and Bounded Free Choice Nets. 1991.

• Esparza, Javier; Silva, Manuel:
  Handles in Petri Nets. 1991.

• Best, Eike; Cherkasova, Ludmila; Desel, Jörg; Esparza, Javier:
  Traps, Free Choice and Home States (Extended Abstract). 1990.

• Esparza, Javier:
  Synthesis Rules for Petri Nets, and How they Lead to New Results. 1990.

• Esparza, Javier; Silva, Manuel:
  Top-Down Synthesis of Live and Bounded Free Choice Nets. 1990.

• Best, Eike; Cherkasova, Ludmila; Desel, Jörg; Esparza, Javier:
  Characterisation of Home States in Free Choice Systems. 1990.

• Desel, Jörg; Esparza, Javier:
  Reachability in Reversible Free Choice Systems. 1990.

• Esparza, Javier:
  Structure Theory of Free Choice Petri Nets. 1990.

• Esparza, Javier; Silva, Manuel:
  Compositional Synthesis of Live and Bounded Free Choice Nets. 1990.

• Esparza, Javier; Silva, Manuel:
  Circuits, Handles, Bridges and Nets. 1989.

• Esparza, J.; Best, E.; Silva, M.:
  Minimal Deadlocks in Free Choice Nets. 1989.

• Esparza, J.; Silva, M.:
  A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. 1989.

• Esparza, Javier:
  Circuits, Handles, Bridges and Nets. 1989.

Back to the Petri Nets Bibliography