Alain Finkel

	2011
74		Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo: Ordinal Theory for Expressiveness of Well Structured Transition Systems. FOSSACS 2011: 153-167
73		Michaël Cadilhac, Alain Finkel, Pierre McKenzie: On the Expressiveness of Parikh Automata and Related Models. NCMA 2011: 103-119
72		Pierre Chambart, Alain Finkel, Sylvain Schmitz: Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets 2011: 49-68
71		Michaël Cadilhac, Alain Finkel, Pierre McKenzie: Bounded Parikh Automata WORDS 2011: 93-102
70		Michaël Cadilhac, Alain Finkel, Pierre McKenzie: Storming the Parikh Automaton CoRR abs/1101.1547: (2011)
	2010
69		Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun: Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS 2010: 192-203
68		Alain Finkel, Arnaud Sangnier: Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. SOFSEM 2010: 394-406
67		Pierre Chambart, Alain Finkel, Sylvain Schmitz: Forward Analysis and Model Checking for Bounded WSTS CoRR abs/1004.2802: (2010)
66		Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen: Model-checking CTL* over flat Presburger counter systems. Journal of Applied Non-Classical Logics 20(4): 313-344 (2010)
	2009
65		Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) 2009: 188-199
64		Florent Bouchy, Alain Finkel, Pierluigi San Pietro: Dense-choice Counter Machines revisited INFINITY 2009: 3-22
63		Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part I: Completions. STACS 2009: 433-444
62		Alain Finkel, Jean Goubault-Larrecq: Forward analysis for WSTS, Part I: Completions CoRR abs/0902.1587: (2009)
61		Florent Bouchy, Alain Finkel, Arnaud Sangnier: Reachability in Timed Counter Systems. Electr. Notes Theor. Comput. Sci. 239: 167-178 (2009)
60		Emmanuelle Encrenaz, Alain Finkel: Automatic Verification of Counter Systems With Ranking Function. Electr. Notes Theor. Comput. Sci. 239: 85-103 (2009)
	2008
59		Alain Finkel, Arnaud Sangnier: Reversal-Bounded Counter Machines Revisited. MFCS 2008: 323-334
58		Florent Bouchy, Alain Finkel, Jérôme Leroux: Decomposition of Decidable First-Order Logics over Integers and Reals. TIME 2008: 147-155
57		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)
56		Florent Bouchy, Alain Finkel, Jérôme Leroux: Decomposition of Decidable First-Order Logics over Integers and Reals CoRR abs/0812.1967: (2008)
55		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci: FAST: acceleration from theory to practice. STTT 10(5): 401-424 (2008)
	2007
54		Alain Finkel, Étienne Lozes, Arnaud Sangnier: Towards Model-Checking Programs with Lists. ILC 2007: 56-86
	2006
53		Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen: Towards a Model-Checker for Counter Systems. ATVA 2006: 493-507
52		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		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen: Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488
50		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		Christophe Darlot, Alain Finkel, Laurent Van Begin: About Fast and TReX Accelerations. Electr. Notes Theor. Comput. Sci. 128(6): 87-103 (2005)
48		Gérard Cécé, Alain Finkel: Verification of programs with half-duplex communication. Inf. Comput. 202(2): 166-190 (2005)
47		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		Sébastien Bardin, Alain Finkel: Composition of Accelerations to Verify Infinite Heterogeneous Systems. ATVA 2004: 248-262
45		Alain Finkel, Jérôme Leroux: Image Computation in Infinite State Model Checking. CAV 2004: 361-371
44		Alain Finkel, Jérôme Leroux: Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN 2004: 182-197
43		Sébastien Bardin, Alain Finkel, Jérôme Leroux: FASTer Acceleration of Counter Automata in Practice. TACAS 2004: 576-590
42		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		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci: FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121
40		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		Alain Finkel, Jérôme Leroux: How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156
38		Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier Roux, Grégoire Sutre: Verification of Embedded Reactive Fiffo Systems. LATIN 2002: 400-414
37		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): 85-106 (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		Alain Finkel, Ph. Schnoebelen: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2): 63-92 (2001)
	2000
34		Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre: Well-Abstracted Transition Systems. CONCUR 2000: 566-580
33		Alain Finkel, Grégoire Sutre: An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. MFCS 2000: 353-362
32		Alain Finkel, Grégoire Sutre: Decidability of Reachability Problems for Classes of Two Counters Automata. STACS 2000: 346-357
31		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		Javier Esparza, Alain Finkel, Richard Mayr: On the Verification of Broadcast Protocols. LICS 1999: 352-359
29		Catherine Dufourd, Alain Finkel: A Polynomial-Bisimilar Normalization for Reset Petri Nets. Theor. Comput. Sci. 222(1-2): 187-194 (1999)
	1998
28		Grégoire Sutre, Alain Finkel, Olivier Roux, Franck Cassez: Effective Recognizability and Model Checking of Reactive Fiffo Automata. AMAST 1998: 106-123
27		Catherine Dufourd, Alain Finkel, Ph. Schnoebelen: Reset Nets Between Decidability and Undecidability. ICALP 1998: 103-115
26		Alain Finkel, Ph. Schnoebelen: Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN 1998: 102-118
25		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		Catherine Dufourd, Alain Finkel: Polynomial-Time Manz-One Reductions for Petri Nets. FSTTCS 1997: 312-326
22		Zakaria Bouziane, Alain Finkel: Cyclic Petri net reachability sets are semi-linear effectively constructible. Electr. Notes Theor. Comput. Sci. 9: 15-24 (1997)
21		Alain Finkel, Bernard Willems, Pierre Wolper: A direct symbolic approach to model checking pushdown systems. Electr. Notes Theor. Comput. Sci. 9: 27-37 (1997)
20		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		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		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

Coauthor Index

1	Sébastien Bardin	[41] [43] [46] [51] [55]
2	Laurent Van Begin	[37] [49] [50] [52]
3	Gérard Berry	[36]
4	Rémi Bonnet	[69] [74]
5	Ahmed Bouajjani	[31]
6	Florent Bouchy	[56] [58] [61] [64]
7	Zakaria Bouziane	[22]
8	Michaël Cadilhac	[70] [71] [73]
9	Franck Cassez	[28] [38]
10	Gérard Cécé	[17] [19] [24] [48]
11	Pierre Chambart	[67] [72]
12	Annie Choquet	[6] [7]
13	Christophe Collet	[25]
14	Hubert Comon-Lundh (Hubert Comon)	[36]
15	Christophe Darlot	[49]
16	Stéphane Demri	[53] [66]
17	Govert van Drimmelen	[53] [66]
18	Catherine Dufourd	[23] [27] [29]
19	Emmanuelle Encrenaz-Tiphène (Emmanuelle Encrenaz)	[60]
20	Patrice Enjalbert	[14]
21	Javier Esparza	[30] [31]
22	Gilles Geeraerts	[50] [52]
23	Rachid Gherbi	[25]
24	Valentin Goranko	[53] [66]
25	Jean Goubault-Larrecq (Jean Goubault)	[62] [63] [65]
26	Serge Haddad	[74]
27	Frédéric Herbreteau	[38]
28	S. Purushothaman Iyer (S. Purushothaman)	[17] [19] [34] [40]
29	Matthias Jantzen	[13]
30	Jérôme Leroux	[39] [41] [43] [44] [45] [47] [51] [55] [56] [57] [58] [69]
31	Étienne Lozes	[54]
32	Oded Maler	[31]
33	Richard Mayr	[30]
34	Pierre McKenzie	[20] [42] [70] [71] [73]
35	Gérard Memmi	[1] [5]
36	Laure Petrucci (Laure Petrucci-Dauchy)	[11] [15] [41] [55]
37	Claudine Picaronny	[42]
38	Pierluigi San Pietro	[64]
39	Jean-François Raskin	[37] [50] [52]
40	Fernando Rosa-Velardo	[74]
41	Louis E. Rosier	[9]
42	Peter Rossmanith	[31]
43	Olivier H. Roux (Olivier Roux)	[28] [38]
44	Mathias Samuelides	[37]
45	Arnaud Sangnier	[54] [59] [61] [68]
46	Sylvain Schmitz	[67] [72]
47	Ph. Schnoebelen (Philippe Schnoebelen)	[26] [27] [35] [51]
48	Grégoire Sutre	[28] [32] [33] [34] [38] [40]
49	Isabelle Tellier	[18]
50	Klaus W. Wagner	[14]
51	Bernard Willems	[21] [31]
52	Pierre Wolper	[21] [31]
53	Marc Zeitoun	[69]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page