Fifo nets: a new model of parallel computation. - Alain Finkel; Gérard Memmi (Theoretical Computer Science, 1983)

Blocage et vivacité dans les réseaux a pile-file. - Alain Finkel (STACS, 1984)

Petri Nets and monogenous FIFO nets. - Alain Finkel (Bull. EATCS, 1984)

Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. - Alain Finkel (Theor. Comput. Sci., 1985)

An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. - Gérard Memmi; Alain Finkel (Theor. Comput. Sci., 1985)

Applications of residues for the analysis of parallel systems communicating by fifo channels. - Annie Choquet; Alain Finkel (Bull. EATCS, 1986)

A Survey on the Decidability Questions for Classes of FIFO Nets. - Alain Finkel; Louis E. Rosier (European Workshop on Applications and Theory of Petri Nets, 1987)

A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. - Alain Finkel (ICALP, 1987)

Fifo Nets Without Order Deadlock. - Alain Finkel; Annie Choquet (Acta Informatica, 1988)

Reduction and covering of infinite reachability trees - Alain Finkel (Inf. Comput., 1990)

The Minimal Coverability Graph for Petri Nets. - Alain Finkel (Applications and Theory of Petri Nets, 1991)

Avoiding State Exposion by Composition of Minimal Covering Graphs. - Alain Finkel; Laure Petrucci (CAV, 1991)

Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. - Gérard Cécé; Alain Finkel; S. Purushothaman Iyer (SIGSOFT FSE, 1994)

Decidability of the Termination Problem for Completely Specified Protocols. - Alain Finkel (Distributed Comput., 1994)

Composition/décomposition de réseaux de petri et de leurs graphes de couverture. - Alain Finkel; Laure Petrucci (RAIRO Theor. Informatics Appl., 1994)

Unreliable Channels are Easier to Verify Than Perfect Channels. - Gérard Cécé; Alain Finkel; S. Purushothaman Iyer (Inf. Comput., 1996)

A Polynomial Algorithm for the Membership Problem with Categorial Grammars. - Alain Finkel; Isabelle Tellier (Theor. Comput. Sci., 1996)

Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). - Gérard Cécé; Alain Finkel (CAV, 1997)

Polynomial-Time Manz-One Reductions for Petri Nets. - Catherine Dufourd; Alain Finkel (FSTTCS, 1997)

Cyclic Petri net reachability sets are semi-linear effectively constructible. - Zakaria Bouziane; Alain Finkel (INFINITY, 1997)

A direct symbolic approach to model checking pushdown systems. - Alain Finkel; Bernard Willems; Pierre Wolper (INFINITY, 1997)

Verifying Identical Communicating Processes is Undecidable. - Alain Finkel; Pierre McKenzie (Theor. Comput. Sci., 1997)

Effective Recognizability and Model Checking of Reactive Fiffo Automata. - Grégoire Sutre; Alain Finkel; Olivier F. Roux; Franck Cassez (AMAST, 1998)

Reset Nets Between Decidability and Undecidability. - Catherine Dufourd; Alain Finkel; Philippe Schnoebelen (ICALP, 1998)

Fundamental Structures in Well-Structured Infinite Transition Systems. - Alain Finkel; Philippe Schnoebelen (LATIN, 1998)

CapRe: a Gaze Tracking System in Man-machine Interaction. - Christophe Collet 002; Alain Finkel; Rachid Gherbi (J. Adv. Comput. Intell. Intell. Informatics, 1998)

On the Verification of Broadcast Protocols. - Javier Esparza; Alain Finkel; Richard Mayr (LICS, 1999)

A Polynomial-Bisimilar Normalization for Reset Petri Nets. - Catherine Dufourd; Alain Finkel (Theor. Comput. Sci., 1999)

Well-Abstracted Transition Systems. - Alain Finkel; S. Purushothaman Iyer; Grégoire Sutre (CONCUR, 2000)

An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. - Alain Finkel; Grégoire Sutre (MFCS, 2000)

Decidability of Reachability Problems for Classes of Two Counters Automata. - Alain Finkel; Grégoire Sutre (STACS, 2000)

An efficient automata approach to some problems on context-free grammars. - Ahmed Bouajjani; Javier Esparza; Alain Finkel; Oded Maler; Peter Rossmanith; Bernard Willems; Pierre Wolper (Inf. Process. Lett., 2000)

Systems and Software Verification, Model-Checking Techniques and Tools. - Béatrice Bérard; Michel Bidoit; Alain Finkel; François Laroussinie; Antoine Petit 001; Laure Petrucci; Philippe Schnoebelen; Pierre McKenzie (Springer, 2001)

Well-structured transition systems everywhere! - Alain Finkel; Philippe Schnoebelen (Theor. Comput. Sci., 2001)

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. - Alain Finkel; Jérôme Leroux (FSTTCS, 2002)

Verification of Embedded Reactive Fiffo Systems. - Frédéric Herbreteau; Franck Cassez; Alain Finkel; Olivier F. Roux; Grégoire Sutre (LATIN, 2002)

Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. - Alain Finkel; Jean-François Raskin; Mathias Samuelides; Laurent Van Begin (INFINITY, 2002)

FAST: Fast Acceleration of Symbolikc Transition Systems. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Laure Petrucci (CAV, 2003)

Well-abstracted transition systems: application to FIFO automata. - Alain Finkel; S. Purushothaman Iyer; Grégoire Sutre (Inf. Comput., 2003)

Composition of Accelerations to Verify Infinite Heterogeneous Systems. - Sébastien Bardin; Alain Finkel (ATVA, 2004)

Image Computation in Infinite State Model Checking. - Alain Finkel; Jérôme Leroux (CAV, 2004)

Polynomial Time Image Computation with Interval-Definable Counters Systems. - Alain Finkel; Jérôme Leroux (SPIN, 2004)

FASTer Acceleration of Counter Automata in Practice. - Sébastien Bardin; Alain Finkel; Jérôme Leroux (TACAS, 2004)

About Fast and TReX Accelerations. - Christophe Darlot; Alain Finkel; Laurent Van Begin (AVoCS, 2004)

On the omega-language Expressive Power of Extended Petri Nets. - Alain Finkel; Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (EXPRESS, 2004)

A well-structured framework for analysing petri net extensions. - Alain Finkel; Pierre McKenzie; Claudine Picaronny (Inf. Comput., 2004)

Flat Acceleration in Symbolic Model Checking. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Philippe Schnoebelen (ATVA, 2005)

Verification of programs with half-duplex communication. - Gérard Cécé; Alain Finkel (Inf. Comput., 2005)

The convex hull of a regular set of integer vectors is polyhedral and effectively computable. - Alain Finkel; Jérôme Leroux (Inf. Process. Lett., 2005)

Towards a Model-Checker for Counter Systems. - Stéphane Demri; Alain Finkel; Valentin Goranko; Govert van Drimmelen (ATVA, 2006)

On the omega-language expressive power of extended Petri nets. - Alain Finkel; Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (Theor. Comput. Sci., 2006)

Towards Model-Checking Programs with Lists. - Alain Finkel; Étienne Lozes; Arnaud Sangnier (ILC, 2007)

Reversal-Bounded Counter Machines Revisited. - Alain Finkel; Arnaud Sangnier (MFCS, 2008)

Decomposition of Decidable First-Order Logics over Integers and Reals. - Florent Bouchy; Alain Finkel; Jérôme Leroux (TIME, 2008)

FAST: acceleration from theory to practice. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Laure Petrucci (Int. J. Softw. Tools Technol. Transf., 2008)

Reachability in Timed Counter Systems. - Florent Bouchy; Alain Finkel; Arnaud Sangnier (INFINITY, 2009)

Automatic Verification of Counter Systems With Ranking Function. - Emmanuelle Encrenaz; Alain Finkel (INFINITY, 2009)

Place-Boundedness for Vector Addition Systems with one zero-test. - Rémi Bonnet; Alain Finkel; Jérôme Leroux; Marc Zeitoun (FSTTCS, 2010)

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. - Alain Finkel; Arnaud Sangnier (SOFSEM, 2010)

Forward Analysis and Model Checking for Bounded WSTS - Pierre Chambart; Alain Finkel; Sylvain Schmitz (CoRR, 2010)

Model-checking CTL* over flat Presburger counter systems. - Stéphane Demri; Alain Finkel; Valentin Goranko; Govert van Drimmelen (J. Appl. Non Class. Logics, 2010)

On the Expressiveness of Parikh Automata and Related Models. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (NCMA, 2011)

Storming the Parikh Automaton - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (CoRR, 2011)

The Theory of WSTS: The Case of Complete WSTS. - Alain Finkel; Jean Goubault-Larrecq (Petri Nets, 2012)

Extending the Rackoff technique to Affine nets. - Rémi Bonnet; Alain Finkel; M. Praveen (FSTTCS, 2012)

Model Checking Vector Addition Systems with one zero-test - Rémi Bonnet; Alain Finkel; Jérôme Leroux; Marc Zeitoun (Log. Methods Comput. Sci., 2012)

Forward Analysis for WSTS, Part II: Complete WSTS - Alain Finkel; Jean Goubault-Larrecq (Log. Methods Comput. Sci., 2012)

Bounded Parikh Automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (Int. J. Found. Comput. Sci., 2012)

Affine Parikh automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (RAIRO Theor. Informatics Appl., 2012)

Reachability in Register Machines with Polynomial Updates. - Alain Finkel; Stefan Göller; Christoph Haase (MFCS, 2013)

Ordinal theory for expressiveness of well-structured transition systems. - Rémi Bonnet; Alain Finkel; Serge Haddad; Fernando Rosa-Velardo (Inf. Comput., 2013)

Unambiguous constrained Automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (Int. J. Found. Comput. Sci., 2013)

Handling Infinitely Branching WSTS. - Michael Blondin; Alain Finkel; Pierre McKenzie (ICALP (2), 2014)

Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). - Javier Esparza; Alain Finkel; Pierre McKenzie; Joël Ouaknine (Dagstuhl Reports, 2014)

Neue, einfache Algorithmen für Petrinetze. - Alain Finkel; Jérôme Leroux (Inform. Spektrum, 2014)

Dense-choice Counter Machines revisited. - Florent Bouchy; Alain Finkel; Pierluigi San Pietro (Theor. Comput. Sci., 2014)

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (LICS, 2015)

Recent and simple algorithms for Petri nets. - Alain Finkel; Jérôme Leroux (Softw. Syst. Model., 2015)

The Ideal Theory for WSTS. - Alain Finkel (RP, 2016)

Approaching the Coverability Problem Continuously. - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (TACAS, 2016)

Preface. - Parosh Aziz Abdulla; Stéphane Demri; Alain Finkel; Jérôme Leroux; Igor Potapov (Fundam. Informaticae, 2016)

Forward analysis and model checking for trace bounded WSTS. - Pierre Chambart; Alain Finkel; Sylvain Schmitz (Theor. Comput. Sci., 2016)

Well Behaved Transition Systems. - Michael Blondin; Alain Finkel; Pierre McKenzie (Log. Methods Comput. Sci., 2017)

The Logical View on Continuous Petri Nets. - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (ACM Trans. Comput. Log., 2017)

Reachability for Two-Counter Machines with One Test and One Reset. - Alain Finkel; Jérôme Leroux; Grégoire Sutre (FSTTCS, 2018)

Parameterized verification of monotone information systems. - Raphaël Chane-Yack-Fa; Marc Frappier; Amel Mammar; Alain Finkel (Formal Aspects Comput., 2018)

Handling infinitely branching well-structured transition systems. - Michael Blondin; Alain Finkel; Pierre McKenzie (Inf. Comput., 2018)

Coverability and Termination in Recursive Petri Nets. - Alain Finkel; Serge Haddad; Igor Khmelnitsky (Petri Nets, 2019)

The Well Structured Problem for Presburger Counter Machines. - Alain Finkel; Ekanshdeep Gupta (FSTTCS, 2019)

Minimal Coverability Tree Construction Made Complete and Efficient. - Alain Finkel; Serge Haddad; Igor Khmelnitsky (FoSSaCS, 2020)

From Well Structured Transition Systems to Program Verification. - Alain Finkel (VPT/HCVS@ETAPS, 2020)

Property-Directed Verification of Recurrent Neural Networks. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (CoRR, 2020)

Forward Analysis for WSTS, Part III: Karp-Miller Trees. - Michael Blondin; Alain Finkel; Jean Goubault-Larrecq (Log. Methods Comput. Sci., 2020)

Verification of Flat FIFO Systems. - Alain Finkel; M. Praveen (Log. Methods Comput. Sci., 2020)

Forward analysis for WSTS, part I: completions. - Alain Finkel; Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2020)

Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Xuan Xie; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (ATVA, 2021)

A Unifying Framework for Deciding Synchronizability. - Benedikt Bollig; Cinzia Di Giusto; Alain Finkel; Laetitia Laversa; Étienne Lozes; Amrita Suresh 001 (CONCUR, 2021)

Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. - Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Igor Khmelnitsky; Martin Leucker; Daniel Neider; Rajarshi Roy 002; Lina Ye (ICGI, 2021)

Commodification of accelerations for the Karp and Miller Construction. - Alain Finkel; Serge Haddad; Igor Khmelnitsky (Discret. Event Dyn. Syst., 2021)

Coverability, Termination, and Finiteness in Recursive Petri Nets. - Alain Finkel; Serge Haddad; Igor Khmelnitsky (Fundam. Informaticae, 2021)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States. - Michael Blondin; Matthias Englert; Alain Finkel; Stefan Göller; Christoph Haase; Ranko Lazic 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

Natural Language Processing for Cognitive Analysis of Emotions. - Gustave Cortal; Alain Finkel; Patrick Paroubek; Lina Ye (CoRR, 2022)

Bounded Reachability Problems are Decidable in FIFO Machines. - Benedikt Bollig; Alain Finkel; Amrita Suresh 001 (Log. Methods Comput. Sci., 2022)

About Decisiveness of Dynamic Probabilistic Models. - Alain Finkel; Serge Haddad; Lina Ye (CONCUR, 2023)

Détection de l'émotion à partir de ses composantes à l'aide d'un corpus de récits émotionnels. - Gustave Cortal; Alain Finkel; Patrick Paroubek; Lina Ye (EGC, 2023)

Counter Machines with Infrequent Reversals. - Alain Finkel; Shankara Narayanan Krishna; Khushraj Madnani; Rupak Majumdar; Georg Zetzsche (FSTTCS, 2023)

Introducing Divergence for Infinite Probabilistic Models. - Alain Finkel; Serge Haddad; Lina Ye (RP, 2023)

Emotion Recognition based on Psychological Components in Guided Narratives for Emotion Regulation. - Gustave Cortal; Alain Finkel; Patrick Paroubek; Lina Ye (CoRR, 2023)

Synchronizability of Communicating Finite State Machines is not Decidable. - Alain Finkel; Étienne Lozes (Log. Methods Comput. Sci., 2023)

Analysis of recurrent neural networks via property-directed verification of surrogate models. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Xuan Xie; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (Int. J. Softw. Tools Technol. Transf., 2023)

Textualized and Feature-Based Models for Compound Multimodal Emotion Recognition in the Wild. - Nicolas Richet; Soufiane Belharbi; Haseeb Aslam; Meike Emilie Schadt; Manuela González-González; Gustave Cortal; Alessandro Lameiras Koerich; Marco Pedersoli; Alain Finkel; Simon Bacon; Eric Granger (ECCV Workshops (15), 2024)

Soundness of reset workflow nets. - Michael Blondin; Alain Finkel; Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (LICS, 2024)

Resilience and Home-Space for WSTS. - Alain Finkel; Mathieu Hilaire (VMCAI (1), 2024)

Branch-Well-Structured Transition Systems and Extensions. - Benedikt Bollig; Alain Finkel; Amrita Suresh 001 (Log. Methods Comput. Sci., 2024)

An Automata-Based Method to Formalize Psychological Theories: The Case Study of Lazarus and Folkman's Stress Theory. - Alain Finkel; Gaspard Fougea; Stéphane Le Roux 001 (MODELSWARD, 2025)