| 2009 |
|---|
| 60 | EE | Alain Finkel,
Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part I: Completions.
STACS 2009: 433-444 |
| 59 | EE | Alain Finkel,
Jean Goubault-Larrecq:
Forward analysis for WSTS, Part I: Completions
CoRR abs/0902.1587: (2009) |
| 2008 |
|---|
| 58 | EE | Alain Finkel,
Arnaud Sangnier:
Reversal-Bounded Counter Machines Revisited.
MFCS 2008: 323-334 |
| 57 | EE | Florent Bouchy,
Alain Finkel,
Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals.
TIME 2008: 147-155 |
| 56 | EE | Alain Finkel,
Jérôme Leroux:
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
CoRR abs/0812.1951: (2008) |
| 55 | EE | Florent Bouchy,
Alain Finkel,
Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals
CoRR abs/0812.1967: (2008) |
| 54 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux,
Laure Petrucci:
FAST: acceleration from theory to practice.
STTT 10(5): 401-424 (2008) |
| 2006 |
|---|
| 53 | EE | Stéphane Demri,
Alain Finkel,
Valentin Goranko,
Govert van Drimmelen:
Towards a Model-Checker for Counter Systems.
ATVA 2006: 493-507 |
| 52 | EE | Alain Finkel,
Gilles Geeraerts,
Jean-François Raskin,
Laurent Van Begin:
On the omega-language expressive power of extended Petri nets.
Theor. Comput. Sci. 356(3): 374-386 (2006) |
| 2005 |
|---|
| 51 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux,
Ph. Schnoebelen:
Flat Acceleration in Symbolic Model Checking.
ATVA 2005: 474-488 |
| 50 | EE | Alain Finkel,
Gilles Geeraerts,
Jean-François Raskin,
Laurent Van Begin:
On the omega-language Expressive Power of Extended Petri Nets.
Electr. Notes Theor. Comput. Sci. 128(2): 87-101 (2005) |
| 49 | EE | Christophe Darlot,
Alain Finkel,
Laurent Van Begin:
About Fast and TReX Accelerations.
Electr. Notes Theor. Comput. Sci. 128(6): 87-103 (2005) |
| 48 | EE | Gérard Cécé,
Alain Finkel:
Verification of programs with half-duplex communication.
Inf. Comput. 202(2): 166-190 (2005) |
| 47 | EE | Alain Finkel,
Jérôme Leroux:
The convex hull of a regular set of integer vectors is polyhedral and effectively computable.
Inf. Process. Lett. 96(1): 30-35 (2005) |
| 2004 |
|---|
| 46 | EE | Sébastien Bardin,
Alain Finkel:
Composition of Accelerations to Verify Infinite Heterogeneous Systems.
ATVA 2004: 248-262 |
| 45 | EE | Alain Finkel,
Jérôme Leroux:
Image Computation in Infinite State Model Checking.
CAV 2004: 361-371 |
| 44 | EE | Alain Finkel,
Jérôme Leroux:
Polynomial Time Image Computation with Interval-Definable Counters Systems.
SPIN 2004: 182-197 |
| 43 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux:
FASTer Acceleration of Counter Automata in Practice.
TACAS 2004: 576-590 |
| 42 | EE | Alain Finkel,
Pierre McKenzie,
Claudine Picaronny:
A well-structured framework for analysing petri net extensions.
Inf. Comput. 195(1-2): 1-29 (2004) |
| 2003 |
|---|
| 41 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux,
Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems.
CAV 2003: 118-121 |
| 40 | EE | Alain Finkel,
S. Purushothaman Iyer,
Grégoire Sutre:
Well-abstracted transition systems: application to FIFO automata.
Inf. Comput. 181(1): 1-31 (2003) |
| 2002 |
|---|
| 39 | EE | Alain Finkel,
Jérôme Leroux:
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.
FSTTCS 2002: 145-156 |
| 38 | EE | Frédéric Herbreteau,
Franck Cassez,
Alain Finkel,
Olivier Roux,
Grégoire Sutre:
Verification of Embedded Reactive Fiffo Systems.
LATIN 2002: 400-414 |
| 37 | EE | Alain Finkel,
Jean-François Raskin,
Mathias Samuelides,
Laurent Van Begin:
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
Electr. Notes Theor. Comput. Sci. 68(6): (2002) |
| 2001 |
|---|
| 36 | | Gérard Berry,
Hubert Comon,
Alain Finkel:
Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings
Springer 2001 |
| 35 | EE | Alain Finkel,
Ph. Schnoebelen:
Well-structured transition systems everywhere!
Theor. Comput. Sci. 256(1-2): 63-92 (2001) |
| 2000 |
|---|
| 34 | EE | Alain Finkel,
S. Purushothaman Iyer,
Grégoire Sutre:
Well-Abstracted Transition Systems.
CONCUR 2000: 566-580 |
| 33 | EE | Alain Finkel,
Grégoire Sutre:
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS.
MFCS 2000: 353-362 |
| 32 | EE | Alain Finkel,
Grégoire Sutre:
Decidability of Reachability Problems for Classes of Two Counters Automata.
STACS 2000: 346-357 |
| 31 | EE | Ahmed Bouajjani,
Javier Esparza,
Alain Finkel,
Oded Maler,
Peter Rossmanith,
Bernard Willems,
Pierre Wolper:
An efficient automata approach to some problems on context-free grammars.
Inf. Process. Lett. 74(5-6): 221-227 (2000) |
| 1999 |
|---|
| 30 | EE | Javier Esparza,
Alain Finkel,
Richard Mayr:
On the Verification of Broadcast Protocols.
LICS 1999: 352-359 |
| 29 | EE | Catherine Dufourd,
Alain Finkel:
A Polynomial-Bisimilar Normalization for Reset Petri Nets.
Theor. Comput. Sci. 222(1-2): 187-194 (1999) |
| 1998 |
|---|
| 28 | EE | Grégoire Sutre,
Alain Finkel,
Olivier Roux,
Franck Cassez:
Effective Recognizability and Model Checking of Reactive Fiffo Automata.
AMAST 1998: 106-123 |
| 27 | EE | Catherine Dufourd,
Alain Finkel,
Ph. Schnoebelen:
Reset Nets Between Decidability and Undecidability.
ICALP 1998: 103-115 |
| 26 | EE | Alain Finkel,
Ph. Schnoebelen:
Fundamental Structures in Well-Structured Infinite Transition Systems.
LATIN 1998: 102-118 |
| 25 | EE | Christophe Collet,
Alain Finkel,
Rachid Gherbi:
CapRe: a Gaze Tracking System in Man-machine Interaction.
JACIII 2(3): 77-81 (1998) |
| 1997 |
|---|
| 24 | | Gérard Cécé,
Alain Finkel:
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract).
CAV 1997: 304-315 |
| 23 | EE | Catherine Dufourd,
Alain Finkel:
Polynomial-Time Manz-One Reductions for Petri Nets.
FSTTCS 1997: 312-326 |
| 22 | EE | Alain Finkel,
Bernard Willems,
Pierre Wolper:
A direct symbolic approach to model checking pushdown systems.
Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 21 | EE | Zakaria Bouziane,
Alain Finkel:
Cyclic Petri net reachability sets are semi-linear effectively constructible.
Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 20 | EE | Alain Finkel,
Pierre McKenzie:
Verifying Identical Communicating Processes is Undecidable.
Theor. Comput. Sci. 174(1-2): 217-230 (1997) |
| 1996 |
|---|
| 19 | | Gérard Cécé,
Alain Finkel,
S. Purushothaman Iyer:
Unreliable Channels are Easier to Verify Than Perfect Channels.
Inf. Comput. 124(1): 20-31 (1996) |
| 18 | EE | Alain Finkel,
Isabelle Tellier:
A Polynomial Algorithm for the Membership Problem with Categorial Grammars.
Theor. Comput. Sci. 164(1&2): 207-221 (1996) |
| 1994 |
|---|
| 17 | EE | Gérard Cécé,
Alain Finkel,
S. Purushothaman Iyer:
Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.
SIGSOFT FSE 1994: 35-43 |
| 16 | | Alain Finkel:
Decidability of the Termination Problem for Completely Specified Protocols.
Distributed Computing 7(3): 129-135 (1994) |
| 15 | | Alain Finkel,
Laure Petrucci:
Composition/décomposition de réseaux de petri et de leurs graphes de couverture.
ITA 28(2): 73-124 (1994) |
| 1993 |
|---|
| 14 | | Patrice Enjalbert,
Alain Finkel,
Klaus W. Wagner:
STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings
Springer 1993 |
| 1992 |
|---|
| 13 | | Alain Finkel,
Matthias Jantzen:
STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings
Springer 1992 |
| 1991 |
|---|
| 12 | | Alain Finkel:
The Minimal Coverability Graph for Petri Nets.
Applications and Theory of Petri Nets 1991: 210-243 |
| 11 | | Alain Finkel,
Laure Petrucci:
Avoiding State Exposion by Composition of Minimal Covering Graphs.
CAV 1991: 169-180 |
| 1990 |
|---|
| 10 | | Alain Finkel:
Reduction and covering of infinite reachability trees
Inf. Comput. 89(2): 144-179 (1990) |
| 1987 |
|---|
| 9 | | Alain Finkel,
Louis E. Rosier:
A Survey on the Decidability Questions for Classes of FIFO Nets.
European Workshop on Applications and Theory of Petri Nets 1987: 106-132 |
| 8 | | Alain Finkel:
A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems.
ICALP 1987: 499-508 |
| 7 | | Alain Finkel,
Annie Choquet:
Fifo Nets Without Order Deadlock.
Acta Inf. 25(1): 15-36 (1987) |
| 1986 |
|---|
| 6 | | Annie Choquet,
Alain Finkel:
Applications of residues for the analysis of parallel systems communicating by fifo channels.
Bulletin of the EATCS 30: 44-56 (1986) |
| 1985 |
|---|
| 5 | | Gérard Memmi,
Alain Finkel:
An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets.
Theor. Comput. Sci. 35: 191-214 (1985) |
| 4 | | Alain Finkel:
Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis.
Theor. Comput. Sci. 38: 137-142 (1985) |
| 1984 |
|---|
| 3 | | Alain Finkel:
Blocage et vivacité dans les réseaux a pile-file.
STACS 1984: 151-162 |
| 2 | | Alain Finkel:
Petri Nets and monogenous FIFO nets.
Bulletin of the EATCS 23: 28-30 (1984) |
| 1983 |
|---|
| 1 | | Alain Finkel,
Gérard Memmi:
Fifo nets: a new model of parallel computation.
Theoretical Computer Science 1983: 111-121 |
