Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alain Finkel
2010 – today
- 2013
[j34]Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo: Ordinal theory for expressiveness of well-structured transition systems. Inf. Comput. 224: 1-22 (2013)- 2012
- [j33]Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun: Model Checking Vector Addition Systems with one zero-test. Logical Methods in Computer Science 8(2) (2012)
- [j32]Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part II: Complete WSTS. Logical Methods in Computer Science 8(3) (2012)
- [j31]Michaël Cadilhac, Alain Finkel, Pierre McKenzie: Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23(8): 1691-1710 (2012)
- [j30]Michaël Cadilhac, Alain Finkel, Pierre McKenzie: Affine Parikh automata. RAIRO - Theor. Inf. and Applic. 46(4): 511-545 (2012)
- [c40]Alain Finkel, Jean Goubault-Larrecq: The Theory of WSTS: The Case of Complete WSTS. Petri Nets 2012: 3-31
- [c39]Michaël Cadilhac, Alain Finkel, Pierre McKenzie: Unambiguous Constrained Automata. Developments in Language Theory 2012: 239-250
- [c38]Rémi Bonnet, Alain Finkel, M. Praveen: Extending the Rackoff technique to Affine nets. FSTTCS 2012: 301-312
- [e4]Alain Finkel, Jérôme Leroux, Igor Potapov (Eds.): Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings. Lecture Notes in Computer Science 7550, Springer 2012, ISBN 978-3-642-33511-2
- 2011
- [c37]Pierre Chambart, Alain Finkel, Sylvain Schmitz: Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets 2011: 49-68
- [c36]Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo: Ordinal Theory for Expressiveness of Well Structured Transition Systems. FOSSACS 2011: 153-167
- [c35]Michaël Cadilhac, Alain Finkel, Pierre McKenzie: On the Expressiveness of Parikh Automata and Related Models. NCMA 2011: 103-119
- [c34]
- [i5]Michaël Cadilhac, Alain Finkel, Pierre McKenzie: Storming the Parikh Automaton. CoRR abs/1101.1547 (2011)
- 2010
- [j29]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)
- [c33]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
- [c32]Alain Finkel, Arnaud Sangnier: Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. SOFSEM 2010: 394-406
- [i4]Pierre Chambart, Alain Finkel, Sylvain Schmitz: Forward Analysis and Model Checking for Bounded WSTS. CoRR abs/1004.2802 (2010)
2000 – 2009
- 2009
- [j28]Emmanuelle Encrenaz, Alain Finkel: Automatic Verification of Counter Systems With Ranking Function. Electr. Notes Theor. Comput. Sci. 239: 85-103 (2009)
- [j27]Florent Bouchy, Alain Finkel, Arnaud Sangnier: Reachability in Timed Counter Systems. Electr. Notes Theor. Comput. Sci. 239: 167-178 (2009)
- [c31]Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) 2009: 188-199
- [c30]Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part I: Completions. STACS 2009: 433-444
- [c29]Florent Bouchy, Alain Finkel, Pierluigi San Pietro: Dense-choice Counter Machines revisited. INFINITY 2009: 3-22
- [i3]Alain Finkel, Jean Goubault-Larrecq: Forward analysis for WSTS, Part I: Completions. CoRR abs/0902.1587 (2009)
- 2008
- [j26]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci: FAST: acceleration from theory to practice. STTT 10(5): 401-424 (2008)
- [c28]
- [c27]Florent Bouchy, Alain Finkel, Jérôme Leroux: Decomposition of Decidable First-Order Logics over Integers and Reals. TIME 2008: 147-155
- [i2]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)
- [i1]Florent Bouchy, Alain Finkel, Jérôme Leroux: Decomposition of Decidable First-Order Logics over Integers and Reals. CoRR abs/0812.1967 (2008)
- 2007
- [c26]Alain Finkel, Étienne Lozes, Arnaud Sangnier: Towards Model-Checking Programs with Lists. ILC 2007: 56-86
- 2006
- [j25]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)
- [c25]Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen: Towards a Model-Checker for Counter Systems. ATVA 2006: 493-507
- 2005
- [j24]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)
- [j23]Christophe Darlot, Alain Finkel, Laurent Van Begin: About Fast and TReX Accelerations. Electr. Notes Theor. Comput. Sci. 128(6): 87-103 (2005)
- [j22]Gérard Cécé, Alain Finkel: Verification of programs with half-duplex communication. Inf. Comput. 202(2): 166-190 (2005)
- [j21]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)
- [c24]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen: Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488
- 2004
- [j20]Alain Finkel, Pierre McKenzie, Claudine Picaronny: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1-2): 1-29 (2004)
- [c23]Sébastien Bardin, Alain Finkel: Composition of Accelerations to Verify Infinite Heterogeneous Systems. ATVA 2004: 248-262
- [c22]
- [c21]Alain Finkel, Jérôme Leroux: Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN 2004: 182-197
- [c20]Sébastien Bardin, Alain Finkel, Jérôme Leroux: FASTer Acceleration of Counter Automata in Practice. TACAS 2004: 576-590
- 2003
- [j19]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre: Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1): 1-31 (2003)
- [c19]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci: FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121
- 2002
- [j18]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)
- [c18]Alain Finkel, Jérôme Leroux: How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156
- [c17]Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier Roux, Grégoire Sutre: Verification of Embedded Reactive Fiffo Systems. LATIN 2002: 400-414
- 2001
- [j17]Alain Finkel, Ph. Schnoebelen: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2): 63-92 (2001)
- [e3]Gérard Berry, Hubert Comon, Alain Finkel (Eds.): Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings. Lecture Notes in Computer Science 2102, Springer 2001, ISBN 3-540-42345-1
- 2000
- [j16]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)
- [c16]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre: Well-Abstracted Transition Systems. CONCUR 2000: 566-580
- [c15]Alain Finkel, Grégoire Sutre: An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. MFCS 2000: 353-362
- [c14]Alain Finkel, Grégoire Sutre: Decidability of Reachability Problems for Classes of Two Counters Automata. STACS 2000: 346-357
1990 – 1999
- 1999
- [j15]Catherine Dufourd, Alain Finkel: A Polynomial-Bisimilar Normalization for Reset Petri Nets. Theor. Comput. Sci. 222(1-2): 187-194 (1999)
- [c13]Javier Esparza, Alain Finkel, Richard Mayr: On the Verification of Broadcast Protocols. LICS 1999: 352-359
- 1998
- [j14]Christophe Collet, Alain Finkel, Rachid Gherbi: CapRe: a Gaze Tracking System in Man-machine Interaction. JACIII 2(3): 77-81 (1998)
- [c12]Grégoire Sutre, Alain Finkel, Olivier Roux, Franck Cassez: Effective Recognizability and Model Checking of Reactive Fiffo Automata. AMAST 1998: 106-123
- [c11]Catherine Dufourd, Alain Finkel, Ph. Schnoebelen: Reset Nets Between Decidability and Undecidability. ICALP 1998: 103-115
- [c10]Alain Finkel, Ph. Schnoebelen: Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN 1998: 102-118
- 1997
- [j13]Zakaria Bouziane, Alain Finkel: Cyclic Petri net reachability sets are semi-linear effectively constructible. Electr. Notes Theor. Comput. Sci. 9: 15-24 (1997)
- [j12]Alain Finkel, Bernard Willems, Pierre Wolper: A direct symbolic approach to model checking pushdown systems. Electr. Notes Theor. Comput. Sci. 9: 27-37 (1997)
- [j11]Alain Finkel, Pierre McKenzie: Verifying Identical Communicating Processes is Undecidable. Theor. Comput. Sci. 174(1-2): 217-230 (1997)
- [c9]Gérard Cécé, Alain Finkel: Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). CAV 1997: 304-315
- [c8]Catherine Dufourd, Alain Finkel: Polynomial-Time Manz-One Reductions for Petri Nets. FSTTCS 1997: 312-326
- 1996
- [j10]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)
- [j9]Alain Finkel, Isabelle Tellier: A Polynomial Algorithm for the Membership Problem with Categorial Grammars. Theor. Comput. Sci. 164(1&2): 207-221 (1996)
- 1994
- [j8]Alain Finkel: Decidability of the Termination Problem for Completely Specified Protocols. Distributed Computing 7(3): 129-135 (1994)
- [j7]Alain Finkel, Laure Petrucci: Composition/décomposition de réseaux de petri et de leurs graphes de couverture. ITA 28(2): 73-124 (1994)
- [c7]Gérard Cécé, Alain Finkel, S. Purushothaman Iyer: Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. SIGSOFT FSE 1994: 35-43
- 1993
- [e2]Patrice Enjalbert, Alain Finkel, Klaus W. Wagner (Eds.): STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings. Lecture Notes in Computer Science 665, Springer 1993, ISBN 3-540-56503-5
- 1992
- [e1]Alain Finkel, Matthias Jantzen (Eds.): STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings. Lecture Notes in Computer Science 577, Springer 1992, ISBN 3-540-55210-3
- 1991
- [c6]Alain Finkel: The Minimal Coverability Graph for Petri Nets. Applications and Theory of Petri Nets 1991: 210-243
- [c5]Alain Finkel, Laure Petrucci: Avoiding State Exposion by Composition of Minimal Covering Graphs. CAV 1991: 169-180
- 1990
- [j6]Alain Finkel: Reduction and covering of infinite reachability trees. Inf. Comput. 89(2): 144-179 (1990)
1980 – 1989
- 1987
- [j5]
- [c4]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
- [c3]Alain Finkel: A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. ICALP 1987: 499-508
- 1986
- [j4]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
- [j3]Gérard Memmi, Alain Finkel: An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. Theor. Comput. Sci. 35: 191-214 (1985)
- [j2]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
- [j1]
- [c2]
- 1983
- [c1]Alain Finkel, Gérard Memmi: Fifo nets: a new model of parallel computation. Theoretical Computer Science 1983: 111-121
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 21:37 CEST by the dblp team