#### Filter Results:

- Full text PDF available (85)

#### Publication Year

1983

2017

- This year (3)
- Last 5 years (20)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alain Finkel, Philippe Schnoebelen
- Theor. Comput. Sci.
- 2001

Well-structured transition systems (WSTS's) are a general class of innnite state systems for which decidability results rely on the existence of a well-quasi-ordering between states that is compatible with the transitions. In this article, we provide an extensive treatment of the WSTS idea and show several new results. Our improved deenitions allow many… (More)

- Bernard Boigelot, Daniel Ribbens, Pascal Gribomont, Pierre-Yves Schobbens, Alain Finkel
- 1998

In this thesis, we introduce a general method for computing the set of reachable states of an in nite-state system. The basic idea, inspired by well-known statespace exploration methods for nite-state systems, is to propagate reachability from the initial state of the system in order to determine exactly which are the reachable states. Of course, the… (More)

- Catherine Dufourd, Alain Finkel, Philippe Schnoebelen
- ICALP
- 1998

We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In… (More)

- Alain Finkel, Jérôme Leroux
- FSTTCS
- 2002

- Alain Finkel, Bernard Willems, Pierre Wolper
- Electr. Notes Theor. Comput. Sci.
- 1997

This paper gives a simple and direct algorithm for computing the always regular set of reachable states of a pushdown system. It then exploits this algorithm for obtaining model checking algorithms for linear-time temporal logic as well as for the logic CTL . For the latter, a new technical tool is introduced: pushdown automata with transitions conditioned… (More)

- 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 modelchecking problem for… (More)

- Alain Finkel
- Applications and Theory of Petri Nets
- 1991

- Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
- Inf. Comput.
- 1996

- Alain Finkel, Jean Goubault-Larrecq
- STACS
- 2009

Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now, the theoretical framework for manipulating downward-closed sets was… (More)