Alain Finkel - RankMe

153 papers A* 12A 7B 20C 4Journal 72Unranked 36

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	An Automata-Based Method to Formalize Psychological Theories - The Case Study of Lazarus and Folkman's Stress Theory. CoRR Alain Finkel, Gaspard Fougea, Stéphane Le Roux
2025	C	`conf`	An Automata-Based Method to Formalize Psychological Theories: The Case Study of Lazarus and Folkman's Stress Theory. MODELSWARD Alain Finkel, Gaspard Fougea, Stéphane Le Roux
2025	—	`conf`	Automating Linguistic Frameworks with LLMs: An Approach to Analyze Personal Narratives. FLLM Raphaël Faure, Alain Finkel
2025	A*	`conf`	Formalizing Style in Personal Narratives. EMNLP Gustave Cortal, Alain Finkel
2025	J	`jnl`	Formalizing Style in Personal Narratives. CoRR Gustave Cortal, Alain Finkel
2025	J	`jnl`	Soundness of reset workflow nets. CoRR Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2025	—	`conf`	Tightening the Frontier of Decidability for Decisiveness. QEST+FORMATS Gaspard Fougea, Serge Haddad, Lina Ye, Shreyas Jain, Alain Finkel
2024	J	`jnl`	Branch-Well-Structured Transition Systems and Extensions. Log. Methods Comput. Sci. Benedikt Bollig, Alain Finkel, Amrita Suresh
2024	—	`conf`	Resilience and Home-Space for WSTS. VMCAI (1) Alain Finkel, Mathieu Hilaire
2024	A*	`conf`	Soundness of reset workflow nets. LICS Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2024	—	`conf`	Textualized and Feature-Based Models for Compound Multimodal Emotion Recognition in the Wild. ECCV Workshops (15) 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
2024	J	`jnl`	Textualized and Feature-based Models for Compound Multimodal Emotion Recognition in the Wild. CoRR 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
2023	B	`conf`	About Decisiveness of Dynamic Probabilistic Models. CONCUR Alain Finkel, Serge Haddad, Lina Ye
2023	J	`jnl`	About Decisiveness of Dynamic Probabilistic Models. CoRR Alain Finkel, Serge Haddad, Lina Ye
2023	J	`jnl`	Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
2023	—	`conf`	Counter Machines with Infrequent Reversals. FSTTCS Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche
2023	—	`conf`	Détection de l'émotion à partir de ses composantes à l'aide d'un corpus de récits émotionnels. EGC Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye
2023	J	`jnl`	Emotion Recognition based on Psychological Components in Guided Narratives for Emotion Regulation. CoRR Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye
2023	—	`conf`	Introducing Divergence for Infinite Probabilistic Models. RP Alain Finkel, Serge Haddad, Lina Ye
2023	J	`jnl`	Introducing Divergence for Infinite Probabilistic Models. CoRR Alain Finkel, Serge Haddad, Lina Ye
2023	J	`jnl`	Synchronizability of Communicating Finite State Machines is not Decidable. Log. Methods Comput. Sci. Alain Finkel, Étienne Lozes
2022	J	`jnl`	Bounded Reachability Problems are Decidable in FIFO Machines. Log. Methods Comput. Sci. Benedikt Bollig, Alain Finkel, Amrita Suresh
2022	C	`conf`	Branch-Well-Structured Transition Systems and Extensions. FORTE Benedikt Bollig, Alain Finkel, Amrita Suresh
2022	J	`jnl`	Branch-Well-Structured Transition Systems and Extensions. CoRR Benedikt Bollig, Alain Finkel, Amrita Suresh
2022	J	`jnl`	Natural Language Processing for Cognitive Analysis of Emotions. CoRR Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye
2021	B	`conf`	A Unifying Framework for Deciding Synchronizability. CONCUR Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh
2021	J	`jnl`	Bounded Reachability Problems are Decidable in FIFO Machines. CoRR Benedikt Bollig, Alain Finkel, Amrita Suresh
2021	J	`jnl`	Commodification of accelerations for the Karp and Miller Construction. Discret. Event Dyn. Syst. Alain Finkel, Serge Haddad, Igor Khmelnitsky
2021	J	`jnl`	Coverability, Termination, and Finiteness in Recursive Petri Nets. CoRR Alain Finkel, Serge Haddad, Igor Khmelnitsky
2021	J	`jnl`	Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundam. Informaticae Alain Finkel, Serge Haddad, Igor Khmelnitsky
2021	—	`conf`	Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye
2021	B	`conf`	Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
2021	J	`jnl`	The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
2020	B	`conf`	Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR Benedikt Bollig, Alain Finkel, Amrita Suresh
2020	J	`jnl`	Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
2020	J	`jnl`	Forward analysis for WSTS, part I: completions. Math. Struct. Comput. Sci. Alain Finkel, Jean Goubault-Larrecq
2020	—	`conf`	From Well Structured Transition Systems to Program Verification. VPT/HCVS@ETAPS Alain Finkel
2020	B	`conf`	Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS Alain Finkel, Serge Haddad, Igor Khmelnitsky
2020	J	`jnl`	Property-Directed Verification of Recurrent Neural Networks. CoRR Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
2020	J	`jnl`	Verification of Flat FIFO Systems. Log. Methods Comput. Sci. Alain Finkel, M. Praveen
2019	B	`conf`	Coverability and Termination in Recursive Petri Nets. Petri Nets Alain Finkel, Serge Haddad, Igor Khmelnitsky
2019	—	`conf`	The Well Structured Problem for Presburger Counter Machines. FSTTCS Alain Finkel, Ekanshdeep Gupta
2019	J	`jnl`	The Well Structured Problem for Presburger Counter Machines. CoRR Alain Finkel, Ekanshdeep Gupta
2019	B	`conf`	Verification of Flat FIFO Systems. CONCUR Alain Finkel, M. Praveen
2019	J	`jnl`	Verification of Flat FIFO Systems. CoRR Alain Finkel, M. Praveen
2018	J	`jnl`	Handling infinitely branching well-structured transition systems. Inf. Comput. Michael Blondin, Alain Finkel, Pierre McKenzie
2018	J	`jnl`	Parameterized verification of monotone information systems. Formal Aspects Comput. Raphaël Chane-Yack-Fa, Marc Frappier, Amel Mammar, Alain Finkel
2018	—	`conf`	Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS Alain Finkel, Jérôme Leroux, Grégoire Sutre
2017	—	`conf`	Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
2017	J	`jnl`	Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
2017	A*	`conf`	Synchronizability of Communicating Finite State Machines is not Decidable. ICALP Alain Finkel, Étienne Lozes
2017	J	`jnl`	Synchronizability of Communicating Finite State Machines is not Decidable. CoRR Alain Finkel, Étienne Lozes
2017	J	`jnl`	The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2017	J	`jnl`	Well Behaved Transition Systems. Log. Methods Comput. Sci. Michael Blondin, Alain Finkel, Pierre McKenzie
2016	A	`conf`	Approaching the Coverability Problem Continuously. TACAS Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2016	J	`jnl`	Forward analysis and model checking for trace bounded WSTS. Theor. Comput. Sci. Pierre Chambart, Alain Finkel, Sylvain Schmitz
2016	J	`jnl`	Preface. Fundam. Informaticae Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov
2016	—	`conf`	The Ideal Theory for WSTS. RP Alain Finkel
2016	J	`jnl`	Well Behaved Transition Systems. CoRR Michael Blondin, Alain Finkel, Pierre McKenzie
2015	J	`jnl`	Approaching the Coverability Problem Continuously. CoRR Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2015	A*	`conf`	Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
2015	J	`jnl`	Recent and simple algorithms for Petri nets. Softw. Syst. Model. Alain Finkel, Jérôme Leroux
2014	J	`jnl`	Dense-choice Counter Machines revisited. Theor. Comput. Sci. Florent Bouchy, Alain Finkel, Pierluigi San Pietro
2014	—	`conf`	Handling Infinitely Branching WSTS. ICALP (2) Michael Blondin, Alain Finkel, Pierre McKenzie
2014	J	`jnl`	Neue, einfache Algorithmen für Petrinetze. Inform. Spektrum Alain Finkel, Jérôme Leroux
2014	J	`jnl`	Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). Dagstuhl Reports Javier Esparza, Alain Finkel, Pierre McKenzie, Joël Ouaknine
2014	J	`jnl`	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
2013	J	`jnl`	Ordinal theory for expressiveness of well-structured transition systems. Inf. Comput. Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo
2013	B	`conf`	Reachability in Register Machines with Polynomial Updates. MFCS Alain Finkel, Stefan Göller, Christoph Haase
2013	J	`jnl`	Unambiguous constrained Automata. Int. J. Found. Comput. Sci. Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012	J	`jnl`	Affine Parikh automata. RAIRO Theor. Informatics Appl. Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012	J	`jnl`	Bounded Parikh Automata. Int. J. Found. Comput. Sci. Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012	—	`conf`	Extending the Rackoff technique to Affine nets. FSTTCS Rémi Bonnet, Alain Finkel, M. Praveen
2012	J	`jnl`	Forward Analysis for WSTS, Part II: Complete WSTS Log. Methods Comput. Sci. Alain Finkel, Jean Goubault-Larrecq
2012	J	`jnl`	Model Checking Vector Addition Systems with one zero-test Log. Methods Comput. Sci. Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
2012	—	`ed.`	Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings RP Alain Finkel, Jérôme Leroux, Igor Potapov
2012	B	`conf`	The Theory of WSTS: The Case of Complete WSTS. Petri Nets Alain Finkel, Jean Goubault-Larrecq
2012	C	`conf`	Unambiguous Constrained Automata. Developments in Language Theory Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2011	—	`conf`	Bounded Parikh Automata WORDS Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2011	B	`conf`	Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets Pierre Chambart, Alain Finkel, Sylvain Schmitz
2011	—	`conf`	On the Expressiveness of Parikh Automata and Related Models. NCMA Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2011	B	`conf`	Ordinal Theory for Expressiveness of Well Structured Transition Systems. FoSSaCS Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo
2011	J	`jnl`	Storming the Parikh Automaton CoRR Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2010	J	`jnl`	Forward Analysis and Model Checking for Bounded WSTS CoRR Pierre Chambart, Alain Finkel, Sylvain Schmitz
2010	B	`conf`	Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. SOFSEM Alain Finkel, Arnaud Sangnier
2010	J	`jnl`	Model-checking CTL* over flat Presburger counter systems. J. Appl. Non Class. Logics Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
2010	—	`conf`	Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
2009	—	`conf`	Automatic Verification of Counter Systems With Ranking Function. INFINITY Emmanuelle Encrenaz, Alain Finkel
2009	—	`conf`	Dense-choice Counter Machines revisited INFINITY Florent Bouchy, Alain Finkel, Pierluigi San Pietro
2009	A	`conf`	Forward Analysis for WSTS, Part I: Completions. STACS Alain Finkel, Jean Goubault-Larrecq
2009	—	`conf`	Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) Alain Finkel, Jean Goubault-Larrecq
2009	J	`jnl`	Forward analysis for WSTS, Part I: Completions CoRR Alain Finkel, Jean Goubault-Larrecq
2009	—	`conf`	Reachability in Timed Counter Systems. INFINITY Florent Bouchy, Alain Finkel, Arnaud Sangnier
2008	J	`jnl`	Decomposition of Decidable First-Order Logics over Integers and Reals CoRR Florent Bouchy, Alain Finkel, Jérôme Leroux
2008	C	`conf`	Decomposition of Decidable First-Order Logics over Integers and Reals. TIME Florent Bouchy, Alain Finkel, Jérôme Leroux
2008	J	`jnl`	FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
2008	B	`conf`	Reversal-Bounded Counter Machines Revisited. MFCS Alain Finkel, Arnaud Sangnier
2008	J	`jnl`	The convex hull of a regular set of integer vectors is polyhedral and effectively computable CoRR Alain Finkel, Jérôme Leroux
2007	—	`conf`	Towards Model-Checking Programs with Lists. ILC Alain Finkel, Étienne Lozes, Arnaud Sangnier
2006	J	`jnl`	On the Theor. Comput. Sci. Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2006	B	`conf`	Towards a Model-Checker for Counter Systems. ATVA Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
2005	B	`conf`	Flat Acceleration in Symbolic Model Checking. ATVA Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen
2005	J	`jnl`	The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Inf. Process. Lett. Alain Finkel, Jérôme Leroux
2005	J	`jnl`	Verification of programs with half-duplex communication. Inf. Comput. Gérard Cécé, Alain Finkel
2004	J	`jnl`	A well-structured framework for analysing petri net extensions. Inf. Comput. Alain Finkel, Pierre McKenzie, Claudine Picaronny
2004	—	`conf`	About Fast and TReX Accelerations. AVoCS Christophe Darlot, Alain Finkel, Laurent Van Begin
2004	B	`conf`	Composition of Accelerations to Verify Infinite Heterogeneous Systems. ATVA Sébastien Bardin, Alain Finkel
2004	A	`conf`	FASTer Acceleration of Counter Automata in Practice. TACAS Sébastien Bardin, Alain Finkel, Jérôme Leroux
2004	A*	`conf`	Image Computation in Infinite State Model Checking. CAV Alain Finkel, Jérôme Leroux
2004	—	`conf`	On the omega-language Expressive Power of Extended Petri Nets. EXPRESS Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2004	—	`conf`	Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN Alain Finkel, Jérôme Leroux
2003	A*	`conf`	FAST: Fast Acceleration of Symbolikc Transition Systems. CAV Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
2003	J	`jnl`	Well-abstracted transition systems: application to FIFO automata. Inf. Comput. Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
2002	—	`conf`	How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS Alain Finkel, Jérôme Leroux
2002	—	`conf`	Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. INFINITY Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin
2002	B	`conf`	Verification of Embedded Reactive Fiffo Systems. LATIN Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier F. Roux, Grégoire Sutre
2001	A*	`ed.`	Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings CAV Gérard Berry, Hubert Comon, Alain Finkel
2001	—	`book`	Systems and Software Verification, Model-Checking Techniques and Tools. Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie
2001	J	`jnl`	Well-structured transition systems everywhere! Theor. Comput. Sci. Alain Finkel, Philippe Schnoebelen
2000	B	`conf`	An Algorithm Constructing the Semilinear Post MFCS Alain Finkel, Grégoire Sutre
2000	J	`jnl`	An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper
2000	A	`conf`	Decidability of Reachability Problems for Classes of Two Counters Automata. STACS Alain Finkel, Grégoire Sutre
2000	B	`conf`	Well-Abstracted Transition Systems. CONCUR Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
1999	J	`jnl`	A Polynomial-Bisimilar Normalization for Reset Petri Nets. Theor. Comput. Sci. Catherine Dufourd, Alain Finkel
1999	A*	`conf`	On the Verification of Broadcast Protocols. LICS Javier Esparza, Alain Finkel, Richard Mayr
1998	J	`jnl`	CapRe: a Gaze Tracking System in Man-machine Interaction. J. Adv. Comput. Intell. Intell. Informatics Christophe Collet, Alain Finkel, Rachid Gherbi
1998	—	`conf`	Effective Recognizability and Model Checking of Reactive Fiffo Automata. AMAST Grégoire Sutre, Alain Finkel, Olivier F. Roux, Franck Cassez
1998	B	`conf`	Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN Alain Finkel, Philippe Schnoebelen
1998	A*	`conf`	Reset Nets Between Decidability and Undecidability. ICALP Catherine Dufourd, Alain Finkel, Philippe Schnoebelen
1997	—	`conf`	A direct symbolic approach to model checking pushdown systems. INFINITY Alain Finkel, Bernard Willems, Pierre Wolper
1997	—	`conf`	Cyclic Petri net reachability sets are semi-linear effectively constructible. INFINITY Zakaria Bouziane, Alain Finkel
1997	—	`conf`	Polynomial-Time Manz-One Reductions for Petri Nets. FSTTCS Catherine Dufourd, Alain Finkel
1997	A*	`conf`	Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). CAV Gérard Cécé, Alain Finkel
1997	J	`jnl`	Verifying Identical Communicating Processes is Undecidable. Theor. Comput. Sci. Alain Finkel, Pierre McKenzie
1996	J	`jnl`	A Polynomial Algorithm for the Membership Problem with Categorial Grammars. Theor. Comput. Sci. Alain Finkel, Isabelle Tellier
1996	J	`jnl`	Unreliable Channels are Easier to Verify Than Perfect Channels. Inf. Comput. Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
1994	J	`jnl`	Composition/décomposition de réseaux de petri et de leurs graphes de couverture. RAIRO Theor. Informatics Appl. Alain Finkel, Laure Petrucci
1994	J	`jnl`	Decidability of the Termination Problem for Completely Specified Protocols. Distributed Comput. Alain Finkel
1994	—	`conf`	Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. SIGSOFT FSE Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
1993	A	`ed.`	STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings STACS Patrice Enjalbert, Alain Finkel, Klaus W. Wagner
1992	A	`ed.`	STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings STACS Alain Finkel, Matthias Jantzen
1991	A*	`conf`	Avoiding State Exposion by Composition of Minimal Covering Graphs. CAV Alain Finkel, Laure Petrucci
1991	—	`conf`	The Minimal Coverability Graph for Petri Nets. Applications and Theory of Petri Nets Alain Finkel
1990	J	`jnl`	Reduction and covering of infinite reachability trees Inf. Comput. Alain Finkel
1988	J	`jnl`	Fifo Nets Without Order Deadlock. Acta Informatica Alain Finkel, Annie Choquet
1987	A*	`conf`	A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. ICALP Alain Finkel
1987	—	`conf`	A Survey on the Decidability Questions for Classes of FIFO Nets. European Workshop on Applications and Theory of Petri Nets Alain Finkel, Louis E. Rosier
1986	J	`jnl`	Applications of residues for the analysis of parallel systems communicating by fifo channels. Bull. EATCS Annie Choquet, Alain Finkel
1985	J	`jnl`	An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. Theor. Comput. Sci. Gérard Memmi, Alain Finkel
1985	J	`jnl`	Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. Theor. Comput. Sci. Alain Finkel
1984	A	`conf`	Blocage et vivacité dans les réseaux a pile-file. STACS Alain Finkel
1984	J	`jnl`	Petri Nets and monogenous FIFO nets. Bull. EATCS Alain Finkel
1983	—	`conf`	Fifo nets: a new model of parallel computation. Theoretical Computer Science Alain Finkel, Gérard Memmi