default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Finkel
Person information
- affiliation: ENS Cachan, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Benedikt Bollig, Alain Finkel, Amrita Suresh
:
Branch-Well-Structured Transition Systems and Extensions. Log. Methods Comput. Sci. 20(2) (2024)- [c71]Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Soundness of reset workflow nets. LICS 2024: 13:1-13:14 - [c70]Alain Finkel, Mathieu Hilaire:
Resilience and Home-Space for WSTS. VMCAI (1) 2024: 147-168 - [i22]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:
Textualized and Feature-based Models for Compound Multimodal Emotion Recognition in the Wild. CoRR abs/2407.12927 (2024) - 2023
- [j46]Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. Log. Methods Comput. Sci. 19(4) (2023) - [j45]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. 25(3): 341-354 (2023) - [c69]Alain Finkel, Serge Haddad, Lina Ye:
About Decisiveness of Dynamic Probabilistic Models. CONCUR 2023: 14:1-14:17 - [c68]Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye:
Détection de l'émotion à partir de ses composantes à l'aide d'un corpus de récits émotionnels. EGC 2023: 665-666 - [c67]Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche:
Counter Machines with Infrequent Reversals. FSTTCS 2023: 42:1-42:17 - [c66]Alain Finkel, Serge Haddad, Lina Ye:
Introducing Divergence for Infinite Probabilistic Models. RP 2023: 127-140 - [i21]Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye:
Emotion Recognition based on Psychological Components in Guided Narratives for Emotion Regulation. CoRR abs/2305.10446 (2023) - [i20]Alain Finkel, Serge Haddad, Lina Ye:
About Decisiveness of Dynamic Probabilistic Models. CoRR abs/2305.19564 (2023) - [i19]Alain Finkel, Serge Haddad, Lina Ye:
Introducing Divergence for Infinite Probabilistic Models. CoRR abs/2308.08842 (2023) - 2022
- [j44]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems are Decidable in FIFO Machines. Log. Methods Comput. Sci. 18(1) (2022) - [c65]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Branch-Well-Structured Transition Systems and Extensions. FORTE 2022: 50-66 - [i18]Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye:
Natural Language Processing for Cognitive Analysis of Emotions. CoRR abs/2210.05296 (2022) - [i17]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Branch-Well-Structured Transition Systems and Extensions. CoRR abs/2211.15913 (2022) - 2021
- [j43]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Commodification of accelerations for the Karp and Miller Construction. Discret. Event Dyn. Syst. 31(2): 251-270 (2021) - [j42]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundam. Informaticae 183(1-2): 33-66 (2021) - [j41]Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke:
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68(5): 34:1-34:43 (2021) - [c64]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA 2021: 364-380 - [c63]Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh:
A Unifying Framework for Deciding Synchronizability. CONCUR 2021: 14:1-14:18 - [c62]Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye:
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI 2021: 113-129 - [i16]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems are Decidable in FIFO Machines. CoRR abs/2105.06723 (2021) - [i15]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability, Termination, and Finiteness in Recursive Petri Nets. CoRR abs/2109.06804 (2021) - 2020
- [j40]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16(2) (2020) - [j39]Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. Log. Methods Comput. Sci. 16(4) (2020) - [j38]Alain Finkel, Jean Goubault-Larrecq:
Forward analysis for WSTS, part I: completions. Math. Struct. Comput. Sci. 30(7): 752-832 (2020) - [c61]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR 2020: 49:1-49:17 - [c60]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS 2020: 237-256 - [c59]Alain Finkel:
From Well Structured Transition Systems to Program Verification. VPT/HCVS@ETAPS 2020: 44-49 - [i14]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Property-Directed Verification of Recurrent Neural Networks. CoRR abs/2009.10610 (2020)
2010 – 2019
- 2019
- [c58]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability and Termination in Recursive Petri Nets. Petri Nets 2019: 429-448 - [c57]Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. CONCUR 2019: 12:1-12:17 - [c56]Alain Finkel, Ekanshdeep Gupta:
The Well Structured Problem for Presburger Counter Machines. FSTTCS 2019: 41:1-41:15 - [i13]Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. CoRR abs/1908.07282 (2019) - [i12]Alain Finkel, Ekanshdeep Gupta:
The Well Structured Problem for Presburger Counter Machines. CoRR abs/1910.02736 (2019) - 2018
- [j37]Raphaël Chane-Yack-Fa, Marc Frappier, Amel Mammar, Alain Finkel:
Parameterized verification of monotone information systems. Formal Aspects Comput. 30(3-4): 463-489 (2018) - [j36]Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling infinitely branching well-structured transition systems. Inf. Comput. 258: 28-49 (2018) - [c55]Alain Finkel, Jérôme Leroux, Grégoire Sutre:
Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS 2018: 31:1-31:14 - 2017
- [j35]Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. Log. Methods Comput. Sci. 13(3) (2017) - [j34]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18(3): 24:1-24:28 (2017) - [c54]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS 2017: 16:1-16:15 - [c53]Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. ICALP 2017: 122:1-122:14 - [i11]Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. CoRR abs/1702.07213 (2017) - [i10]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR abs/1710.07258 (2017) - 2016
- [j33]Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. Fundam. Informaticae 143(3-4): i-ii (2016) - [j32]Pierre Chambart, Alain Finkel, Sylvain Schmitz:
Forward analysis and model checking for trace bounded WSTS. Theor. Comput. Sci. 637: 1-29 (2016) - [c52]Alain Finkel:
The Ideal Theory for WSTS. RP 2016: 1-22 - [c51]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. TACAS 2016: 480-496 - [i9]Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. CoRR abs/1608.02636 (2016) - 2015
- [j31]Alain Finkel, Jérôme Leroux:
Recent and simple algorithms for Petri nets. Softw. Syst. Model. 14(2): 719-725 (2015) - [c50]Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS 2015: 32-43 - [i8]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. CoRR abs/1510.05724 (2015) - 2014
- [j30]Alain Finkel, Jérôme Leroux:
Neue, einfache Algorithmen für Petrinetze. Inform. Spektrum 37(3): 229-236 (2014) - [j29]Florent Bouchy, Alain Finkel, Pierluigi San Pietro:
Dense-choice Counter Machines revisited. Theor. Comput. Sci. 542: 17-31 (2014) - [c49]Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling Infinitely Branching WSTS. ICALP (2) 2014: 13-25 - [i7]Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR abs/1412.4259 (2014) - [i6]Javier Esparza, Alain Finkel, Pierre McKenzie, Joël Ouaknine:
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). Dagstuhl Reports 4(3): 153-180 (2014) - 2013
- [j28]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) - [j27]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous constrained Automata. Int. J. Found. Comput. Sci. 24(7): 1099-1116 (2013) - [c48]Alain Finkel, Stefan Göller, Christoph Haase:
Reachability in Register Machines with Polynomial Updates. MFCS 2013: 409-420 - 2012
- [j26]Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun:
Model Checking Vector Addition Systems with one zero-test. Log. Methods Comput. Sci. 8(2) (2012) - [j25]Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part II: Complete WSTS. Log. Methods Comput. Sci. 8(3) (2012) - [j24]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23(8): 1691-1710 (2012) - [j23]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Affine Parikh automata. RAIRO Theor. Informatics Appl. 46(4): 511-545 (2012) - [c47]Alain Finkel, Jean Goubault-Larrecq:
The Theory of WSTS: The Case of Complete WSTS. Petri Nets 2012: 3-31 - [c46]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous Constrained Automata. Developments in Language Theory 2012: 239-250 - [c45]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:
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 [contents] - 2011
- [c44]Pierre Chambart, Alain Finkel, Sylvain Schmitz:
Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets 2011: 49-68 - [c43]Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo:
Ordinal Theory for Expressiveness of Well Structured Transition Systems. FoSSaCS 2011: 153-167 - [c42]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
On the Expressiveness of Parikh Automata and Related Models. NCMA 2011: 103-119 - [c41]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. WORDS 2011: 93-102 - [i5]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Storming the Parikh Automaton. CoRR abs/1101.1547 (2011) - 2010
- [j22]Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen:
Model-checking CTL* over flat Presburger counter systems. J. Appl. Non Class. Logics 20(4): 313-344 (2010) - [c40]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 - [c39]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
- [c38]Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) 2009: 188-199 - [c37]Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part I: Completions. STACS 2009: 433-444 - [c36]Florent Bouchy, Alain Finkel, Pierluigi San Pietro:
Dense-choice Counter Machines revisited. INFINITY 2009: 3-22 - [c35]Emmanuelle Encrenaz, Alain Finkel:
Automatic Verification of Counter Systems With Ranking Function. INFINITY 2009: 85-103 - [c34]Florent Bouchy, Alain Finkel, Arnaud Sangnier:
Reachability in Timed Counter Systems. INFINITY 2009: 167-178 - [i3]Alain Finkel, Jean Goubault-Larrecq:
Forward analysis for WSTS, Part I: Completions. CoRR abs/0902.1587 (2009) - 2008
- [j21]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10(5): 401-424 (2008) - [c33]Alain Finkel, Arnaud Sangnier:
Reversal-Bounded Counter Machines Revisited. MFCS 2008: 323-334 - [c32]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
- [c31]Alain Finkel, Étienne Lozes, Arnaud Sangnier:
Towards Model-Checking Programs with Lists. ILC 2007: 56-86 - 2006
- [j20]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) - [c30]Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen:
Towards a Model-Checker for Counter Systems. ATVA 2006: 493-507 - 2005
- [j19]Gérard Cécé, Alain Finkel:
Verification of programs with half-duplex communication. Inf. Comput. 202(2): 166-190 (2005) - [j18]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) - [c29]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen:
Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488 - 2004
- [j17]Alain Finkel, Pierre McKenzie, Claudine Picaronny:
A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1-2): 1-29 (2004) - [c28]Sébastien Bardin, Alain Finkel:
Composition of Accelerations to Verify Infinite Heterogeneous Systems. ATVA 2004: 248-262 - [c27]Alain Finkel, Jérôme Leroux:
Image Computation in Infinite State Model Checking. CAV 2004: 361-371 - [c26]Alain Finkel, Jérôme Leroux:
Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN 2004: 182-197 - [c25]Sébastien Bardin, Alain Finkel, Jérôme Leroux:
FASTer Acceleration of Counter Automata in Practice. TACAS 2004: 576-590 - [c24]Christophe Darlot, Alain Finkel, Laurent Van Begin:
About Fast and TReX Accelerations. AVoCS 2004: 87-103 - [c23]Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language Expressive Power of Extended Petri Nets. EXPRESS 2004: 87-101 - 2003
- [j16]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1): 1-31 (2003) - [c22]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121 - 2002
- [c21]Alain Finkel, Jérôme Leroux:
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156 - [c20]Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier F. Roux, Grégoire Sutre:
Verification of Embedded Reactive Fiffo Systems. LATIN 2002: 400-414 - [c19]Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin:
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. INFINITY 2002: 85-106 - 2001
- [b1]Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie:
Systems and Software Verification, Model-Checking Techniques and Tools. Springer 2001, ISBN 978-3-642-07478-3, pp. I-XII, 1-190 - [j15]Alain Finkel, Philippe Schnoebelen:
Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2): 63-92 (2001) - [e3]Gérard Berry, Hubert Comon, Alain Finkel:
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 [contents] - 2000
- [j14]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) - [c18]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-Abstracted Transition Systems. CONCUR 2000: 566-580 - [c17]Alain Finkel, Grégoire Sutre:
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. MFCS 2000: 353-362 - [c16]Alain Finkel, Grégoire Sutre:
Decidability of Reachability Problems for Classes of Two Counters Automata. STACS 2000: 346-357
1990 – 1999
- 1999
- [j13]Catherine Dufourd, Alain Finkel:
A Polynomial-Bisimilar Normalization for Reset Petri Nets. Theor. Comput. Sci. 222(1-2): 187-194 (1999) - [c15]Javier Esparza, Alain Finkel, Richard Mayr:
On the Verification of Broadcast Protocols. LICS 1999: 352-359 - 1998
- [j12]Christophe Collet, Alain Finkel, Rachid Gherbi:
CapRe: a Gaze Tracking System in Man-machine Interaction. J. Adv. Comput. Intell. Intell. Informatics 2(3): 77-81 (1998) - [c14]Grégoire Sutre, Alain Finkel, Olivier F. Roux, Franck Cassez:
Effective Recognizability and Model Checking of Reactive Fiffo Automata. AMAST 1998: 106-123 - [c13]Catherine Dufourd, Alain Finkel, Philippe Schnoebelen:
Reset Nets Between Decidability and Undecidability. ICALP 1998: 103-115 - [c12]Alain Finkel, Philippe Schnoebelen:
Fundamental Structures in Well-Structured Infinite Transition Systems. LATIN 1998: 102-118 - 1997
- [j11]Alain Finkel, Pierre McKenzie:
Verifying Identical Communicating Processes is Undecidable. Theor. Comput. Sci. 174(1-2): 217-230 (1997) - [c11]Gérard Cécé, Alain Finkel:
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). CAV 1997: 304-315 - [c10]Catherine Dufourd, Alain Finkel:
Polynomial-Time Manz-One Reductions for Petri Nets. FSTTCS 1997: 312-326 - [c9]Zakaria Bouziane, Alain Finkel:
Cyclic Petri net reachability sets are semi-linear effectively constructible. INFINITY 1997: 15-24 - [c8]Alain Finkel, Bernard Willems, Pierre Wolper:
A direct symbolic approach to model checking pushdown systems. INFINITY 1997: 27-37 - 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 Comput. 7(3): 129-135 (1994) - [j7]Alain Finkel, Laure Petrucci:
Composition/décomposition de réseaux de petri et de leurs graphes de couverture. RAIRO Theor. Informatics Appl. 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:
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 [contents] - 1992
- [e1]Alain Finkel, Matthias Jantzen:
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 [contents] - 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
- 1988
- [j5]Alain Finkel, Annie Choquet:
Fifo Nets Without Order Deadlock. Acta Informatica 25(1): 15-36 (1988) - 1987
- [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. Bull. 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]Alain Finkel:
Petri Nets and monogenous FIFO nets. Bull. EATCS 23: 28-30 (1984) - [c2]Alain Finkel:
Blocage et vivacité dans les réseaux a pile-file. STACS 1984: 151-162 - 1983
- [c1]Alain Finkel, Gérard Memmi:
Fifo nets: a new model of parallel computation. Theoretical Computer Science 1983: 111-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
