#### Filter Results:

- Full text PDF available (163)

#### Publication Year

1973

2017

- This year (5)
- Last 5 years (56)
- Last 10 years (109)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Ahmed Bouajjani, Javier Esparza, Oded Maler
- CONCUR
- 1997

We apply the symbolic analysis principle to pushdown systems. We represent (possibly innnite) sets of conngurations of such systems by means of nite-state automata. In order to reason in a uniform way about analysis problems involving both exis-tential and universal path quantiication (like model-checking for branching-time logics), we consider the more… (More)

- Javier Esparza, Stefan Römer, Walter Vogler
- Formal Methods in System Design
- 1996

McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finite-state Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial parts that are larger than necessary (exponentially larger in the… (More)

- Javier Esparza
- 1995

- Javier Esparza, Alain Finkel, Richard Mayr
- LICS
- 1999

We analyze the model-checking problems for safety and liveness properties in parameterized broadcast protocols, a model introduced in [5]. We show that the procedure suggested in [5] for safety properties may not terminate, whereas termination is guaranteed for the procedure of [1] based on upward closed sets. We show that the model-checking problem for… (More)

- Javier Esparza, Stefan Schwoon
- CAV
- 2001

- Javier Esparza
- FCT
- 1995

The paper provides a structural characterisation of the reachable markings of Petri nets in which every transition has exactly one input place. As a corollary, the reachability problem for this class is proved to be NP-complete. Further consequences are: the uniform word problem for commutative context-free grammars is NP-complete; weak-bisimilarity is… (More)

- Allan Cheng, Javier Esparza, Jens Palsberg
- FSTTCS
- 1993

We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is… (More)

- Stefan Schwoon, Javier Esparza
- TACAS
- 2005

The automata-theoretic approach to verification of LTL relies on an algorithm for finding accepting cycles in the product of the system and a Büchi automaton for the negation of the formula. Explicit-state model checkers typically construct the product space " on the fly " and explore the states using depth-first search. We survey algorithms proposed for… (More)

- Javier Esparza, Keijo Heljanko
- Monographs in Theoretical Computer Science. An…
- 2008

The design and analysis of concurrent systems has proved to be one of the most vexing practical problems in computer science. We need such systems if we want to compute at high speed and yet distribute the computation over distances too long to allow synchronizing communication to a global clock. At the speed of modern computer systems, one centimeter is… (More)