Alain Finkel
ENS Cachan, Paris, France
http://www.lsv.ens-cachan.fr/~finkel/
https://orcid.org/0000-0003-2482-6141
Alain Finkel
Mathieu Hilaire
Resilience and Home-Space for WSTS.
147-168
2024
VMCAI (1)
https://doi.org/10.1007/978-3-031-50524-9_7
conf/vmcai/2024-1
db/conf/vmcai/vmcai2024-1.html#FinkelH24
Alain Finkel
Étienne Lozes
Synchronizability of Communicating Finite State Machines is not Decidable.
2023
19
Log. Methods Comput. Sci.
4
https://doi.org/10.46298/lmcs-19(4:33)2023
db/journals/lmcs/lmcs19.html#FinkelL23
Igor Khmelnitsky
Daniel Neider
Rajarshi Roy 0002
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.
341-354
2023
June
25
Int. J. Softw. Tools Technol. Transf.
3
https://doi.org/10.1007/s10009-022-00684-w
db/journals/sttt/sttt25.html#KhmelnitskyNRXBBFHLY23
Alain Finkel
Serge Haddad
Lina Ye
About Decisiveness of Dynamic Probabilistic Models.
14:1-14:17
2023
CONCUR
https://doi.org/10.4230/LIPIcs.CONCUR.2023.14
conf/concur/2023
db/conf/concur/concur2023.html#FinkelHY23
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.
665-666
2023
EGC
http://editions-rnti.fr/?inprocid=1002888
conf/f-egc/2023
db/conf/f-egc/egc2023.html#CortalFPY23
Alain Finkel
Shankara Narayanan Krishna
Khushraj Madnani
Rupak Majumdar
Georg Zetzsche
Counter Machines with Infrequent Reversals.
42:1-42:17
2023
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2023.42
conf/fsttcs/2023
db/conf/fsttcs/fsttcs2023.html#FinkelKMMZ23
Alain Finkel
Serge Haddad
Lina Ye
Introducing Divergence for Infinite Probabilistic Models.
127-140
2023
RP
https://doi.org/10.1007/978-3-031-45286-4_10
conf/rp/2023
db/conf/rp/rp2023.html#FinkelHY23
Gustave Cortal
Alain Finkel
Patrick Paroubek
Lina Ye
Emotion Recognition based on Psychological Components in Guided Narratives for Emotion Regulation.
2023
abs/2305.10446
CoRR
https://doi.org/10.48550/arXiv.2305.10446
db/journals/corr/corr2305.html#abs-2305-10446
Alain Finkel
Serge Haddad
Lina Ye
About Decisiveness of Dynamic Probabilistic Models.
2023
abs/2305.19564
CoRR
https://doi.org/10.48550/arXiv.2305.19564
db/journals/corr/corr2305.html#abs-2305-19564
Alain Finkel
Serge Haddad
Lina Ye
Introducing Divergence for Infinite Probabilistic Models.
2023
abs/2308.08842
CoRR
https://doi.org/10.48550/arXiv.2308.08842
db/journals/corr/corr2308.html#abs-2308-08842
Benedikt Bollig
Alain Finkel
Amrita Suresh
Bounded Reachability Problems are Decidable in FIFO Machines.
2022
18
Log. Methods Comput. Sci.
1
https://doi.org/10.46298/lmcs-18(1:19)2022
db/journals/lmcs/lmcs18.html#BolligFS22
Benedikt Bollig
Alain Finkel
Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions.
50-66
2022
FORTE
https://doi.org/10.1007/978-3-031-08679-3_4
conf/forte/2022
db/conf/forte/forte2022.html#BolligFS22
Gustave Cortal
Alain Finkel
Patrick Paroubek
Lina Ye
Natural Language Processing for Cognitive Analysis of Emotions.
2022
abs/2210.05296
CoRR
https://doi.org/10.48550/arXiv.2210.05296
db/journals/corr/corr2210.html#abs-2210-05296
Benedikt Bollig
Alain Finkel
Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions.
2022
abs/2211.15913
CoRR
https://doi.org/10.48550/arXiv.2211.15913
db/journals/corr/corr2211.html#abs-2211-15913
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Commodification of accelerations for the Karp and Miller Construction.
251-270
2021
31
Discret. Event Dyn. Syst.
2
https://doi.org/10.1007/s10626-020-00331-z
db/journals/deds/deds31.html#FinkelHK21
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Coverability, Termination, and Finiteness in Recursive Petri Nets.
33-66
2021
183
Fundam. Informaticae
1-2
https://doi.org/10.3233/FI-2021-2081
db/journals/fuin/fuin183.html#FinkelHK21
Michael Blondin
Matthias Englert
Alain Finkel
Stefan Göller
Christoph Haase
Ranko Lazic 0001
Pierre McKenzie
Patrick Totzke
The Reachability Problem for Two-Dimensional Vector Addition Systems with States.
34:1-34:43
2021
68
J. ACM
5
https://doi.org/10.1145/3464794
db/journals/jacm/jacm68.html#BlondinEFGHLMT21
Igor Khmelnitsky
Daniel Neider
Rajarshi Roy 0002
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.
364-380
2021
ATVA
https://doi.org/10.1007/978-3-030-88885-5_24
conf/atva/2021
db/conf/atva/atva2021.html#KhmelnitskyNRXB21
Benedikt Bollig
Cinzia Di Giusto
Alain Finkel
Laetitia Laversa
Étienne Lozes
Amrita Suresh
A Unifying Framework for Deciding Synchronizability.
14:1-14:18
2021
CONCUR
https://doi.org/10.4230/LIPIcs.CONCUR.2021.14
conf/concur/2021
db/conf/concur/concur2021.html#BolligGFLLS21
Benoît Barbot
Benedikt Bollig
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Martin Leucker
Daniel Neider
Rajarshi Roy 0002
Lina Ye
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search.
113-129
2021
ICGI
https://proceedings.mlr.press/v153/barbot21a.html
conf/icgi/2021
db/conf/icgi/icgi2021.html#BarbotBFHKLN0Y21
Benedikt Bollig
Alain Finkel
Amrita Suresh
Bounded Reachability Problems are Decidable in FIFO Machines.
2021
abs/2105.06723
CoRR
https://arxiv.org/abs/2105.06723
db/journals/corr/corr2105.html#abs-2105-06723
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Coverability, Termination, and Finiteness in Recursive Petri Nets.
2021
abs/2109.06804
CoRR
https://arxiv.org/abs/2109.06804
db/journals/corr/corr2109.html#abs-2109-06804
Michael Blondin
Alain Finkel
Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees.
2020
16
Log. Methods Comput. Sci.
2
https://doi.org/10.23638/LMCS-16(2:13)2020
db/journals/lmcs/lmcs16.html#BlondinFG20
Alain Finkel
M. Praveen
Verification of Flat FIFO Systems.
2020
16
Log. Methods Comput. Sci.
4
https://lmcs.episciences.org/6839
db/journals/lmcs/lmcs16.html#FinkelP20
Alain Finkel
Jean Goubault-Larrecq
Forward analysis for WSTS, part I: completions.
752-832
2020
30
Math. Struct. Comput. Sci.
7
https://doi.org/10.1017/S0960129520000195
db/journals/mscs/mscs30.html#FinkelG20
Benedikt Bollig
Alain Finkel
Amrita Suresh
Bounded Reachability Problems Are Decidable in FIFO Machines.
49:1-49:17
2020
CONCUR
https://doi.org/10.4230/LIPIcs.CONCUR.2020.49
conf/concur/2020
db/conf/concur/concur2020.html#BolligFS20
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Minimal Coverability Tree Construction Made Complete and Efficient.
237-256
2020
FoSSaCS
https://doi.org/10.1007/978-3-030-45231-5_13
conf/fossacs/2020
db/conf/fossacs/fossacs2020.html#FinkelHK20
Alain Finkel
From Well Structured Transition Systems to Program Verification.
VPT/HCVS@ETAPS
2020
44-49
journals/corr/abs-2008-02483
https://doi.org/10.4204/EPTCS.320.3
https://arxiv.org/abs/2008.02929
db/series/eptcs/eptcs320.html#abs-2008-02929
Igor Khmelnitsky
Daniel Neider
Rajarshi Roy 0002
Benoît Barbot
Benedikt Bollig
Alain Finkel
Serge Haddad
Martin Leucker
Lina Ye
Property-Directed Verification of Recurrent Neural Networks.
2020
abs/2009.10610
CoRR
https://arxiv.org/abs/2009.10610
db/journals/corr/corr2009.html#abs-2009-10610
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Coverability and Termination in Recursive Petri Nets.
429-448
2019
Petri Nets
https://doi.org/10.1007/978-3-030-21571-2_23
conf/apn/2019
db/conf/apn/pn2019.html#FinkelHK19
Alain Finkel
M. Praveen
Verification of Flat FIFO Systems.
12:1-12:17
2019
CONCUR
https://doi.org/10.4230/LIPIcs.CONCUR.2019.12
conf/concur/2019
db/conf/concur/concur2019.html#FinkelP19
Alain Finkel
Ekanshdeep Gupta
The Well Structured Problem for Presburger Counter Machines.
41:1-41:15
2019
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2019.41
conf/fsttcs/2019
db/conf/fsttcs/fsttcs2019.html#FinkelG19
Alain Finkel
M. Praveen
Verification of Flat FIFO Systems.
2019
abs/1908.07282
CoRR
http://arxiv.org/abs/1908.07282
db/journals/corr/corr1908.html#abs-1908-07282
Alain Finkel
Ekanshdeep Gupta
The Well Structured Problem for Presburger Counter Machines.
2019
abs/1910.02736
CoRR
http://arxiv.org/abs/1910.02736
db/journals/corr/corr1910.html#abs-1910-02736
Raphaël Chane-Yack-Fa
Marc Frappier
Amel Mammar
Alain Finkel
Parameterized verification of monotone information systems.
463-489
2018
30
Formal Aspects Comput.
3-4
https://doi.org/10.1007/s00165-018-0460-8
db/journals/fac/fac30.html#Chane-Yack-FaFM18
Michael Blondin
Alain Finkel
Pierre McKenzie
Handling infinitely branching well-structured transition systems.
28-49
2018
258
Inf. Comput.
https://doi.org/10.1016/j.ic.2017.11.001
db/journals/iandc/iandc258.html#BlondinFM18
Alain Finkel
Jérôme Leroux
Grégoire Sutre
Reachability for Two-Counter Machines with One Test and One Reset.
31:1-31:14
2018
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2018.31
conf/fsttcs/2018
db/conf/fsttcs/fsttcs2018.html#FinkelLS18
Michael Blondin
Alain Finkel
Pierre McKenzie
Well Behaved Transition Systems.
2017
13
Log. Methods Comput. Sci.
3
https://doi.org/10.23638/LMCS-13(3:24)2017
db/journals/lmcs/lmcs13.html#BlondinFM17
Michael Blondin
Alain Finkel
Christoph Haase
Serge Haddad
The Logical View on Continuous Petri Nets.
24:1-24:28
2017
18
ACM Trans. Comput. Log.
3
https://doi.org/10.1145/3105908
db/journals/tocl/tocl18.html#BlondinFHH17
Michael Blondin
Alain Finkel
Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees.
16:1-16:15
2017
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2017.16
conf/fsttcs/2017
db/conf/fsttcs/fsttcs2017.html#BlondinFG17
Alain Finkel
Étienne Lozes
Synchronizability of Communicating Finite State Machines is not Decidable.
122:1-122:14
2017
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2017.122
conf/icalp/2017
db/conf/icalp/icalp2017.html#FinkelL17
Alain Finkel
Étienne Lozes
Synchronizability of Communicating Finite State Machines is not Decidable.
2017
abs/1702.07213
CoRR
http://arxiv.org/abs/1702.07213
db/journals/corr/corr1702.html#FinkelL17
Michael Blondin
Alain Finkel
Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees.
2017
abs/1710.07258
CoRR
http://arxiv.org/abs/1710.07258
db/journals/corr/corr1710.html#abs-1710-07258
Parosh Aziz Abdulla
Stéphane Demri
Alain Finkel
Jérôme Leroux
Igor Potapov
Preface.
i-ii
2016
143
Fundam. Informaticae
3-4
https://doi.org/10.3233/FI-2016-1311
db/journals/fuin/fuin143.html#AbdullaDFLP16
Pierre Chambart
Alain Finkel
Sylvain Schmitz
Forward analysis and model checking for trace bounded WSTS.
1-29
2016
637
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2016.04.020
db/journals/tcs/tcs637.html#ChambartFS16
Alain Finkel
The Ideal Theory for WSTS.
1-22
2016
RP
https://doi.org/10.1007/978-3-319-45994-3_1
conf/rp/2016
db/conf/rp/rp2016.html#Finkel16
Michael Blondin
Alain Finkel
Christoph Haase
Serge Haddad
Approaching the Coverability Problem Continuously.
480-496
2016
TACAS
https://doi.org/10.1007/978-3-662-49674-9_28
conf/tacas/2016
db/conf/tacas/tacas2016.html#BlondinFHH16
Michael Blondin
Alain Finkel
Pierre McKenzie
Well Behaved Transition Systems.
2016
abs/1608.02636
CoRR
http://arxiv.org/abs/1608.02636
db/journals/corr/corr1608.html#BlondinFM16
Alain Finkel
Jérôme Leroux
Recent and simple algorithms for Petri nets.
719-725
2015
14
Softw. Syst. Model.
2
https://doi.org/10.1007/s10270-014-0426-0
db/journals/sosym/sosym14.html#FinkelL15
Michael Blondin
Alain Finkel
Stefan Göller
Christoph Haase
Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.
32-43
2015
LICS
https://doi.org/10.1109/LICS.2015.14
https://doi.ieeecomputersociety.org/10.1109/LICS.2015.14
http://dl.acm.org/citation.cfm?id=2876520
conf/lics/2015
db/conf/lics/lics2015.html#BlondinFGHM15
Michael Blondin
Alain Finkel
Christoph Haase
Serge Haddad
Approaching the Coverability Problem Continuously.
2015
abs/1510.05724
CoRR
http://arxiv.org/abs/1510.05724
db/journals/corr/corr1510.html#BlondinFHH15
Alain Finkel
Jérôme Leroux
Neue, einfache Algorithmen für Petrinetze.
229-236
2014
37
Inform. Spektrum
3
https://doi.org/10.1007/s00287-013-0753-5
db/journals/insk/insk37.html#FinkelL14
Florent Bouchy
Alain Finkel
Pierluigi San Pietro
Dense-choice Counter Machines revisited.
17-31
2014
542
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2014.04.029
db/journals/tcs/tcs542.html#BouchyFP14
Michael Blondin
Alain Finkel
Pierre McKenzie
Handling Infinitely Branching WSTS.
13-25
2014
ICALP (2)
https://doi.org/10.1007/978-3-662-43951-7_2
conf/icalp/2014-2
db/conf/icalp/icalp2014-2.html#BlondinFM14
Michael Blondin
Alain Finkel
Stefan Göller
Christoph Haase
Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete.
2014
abs/1412.4259
CoRR
http://arxiv.org/abs/1412.4259
db/journals/corr/corr1412.html#BlondinFGHM14
Javier Esparza
Alain Finkel
Pierre McKenzie
Joël Ouaknine
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141).
153-180
2014
4
Dagstuhl Reports
3
https://doi.org/10.4230/DagRep.4.3.153
db/journals/dagstuhl-reports/dagstuhl-reports4.html#EsparzaFMO14
Rémi Bonnet
Alain Finkel
Serge Haddad
Fernando Rosa-Velardo
Ordinal theory for expressiveness of well-structured transition systems.
1-22
2013
224
Inf. Comput.
https://doi.org/10.1016/j.ic.2012.11.003
https://www.wikidata.org/entity/Q57831201
db/journals/iandc/iandc224.html#BonnetFHR13
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
Unambiguous constrained Automata.
1099-1116
2013
24
Int. J. Found. Comput. Sci.
7
https://doi.org/10.1142/S0129054113400339
db/journals/ijfcs/ijfcs24.html#CadilhacFM13
Alain Finkel
Stefan Göller
Christoph Haase
Reachability in Register Machines with Polynomial Updates.
409-420
2013
MFCS
https://doi.org/10.1007/978-3-642-40313-2_37
conf/mfcs/2013
db/conf/mfcs/mfcs2013.html#FinkelGH13
Rémi Bonnet
Alain Finkel
Jérôme Leroux
Marc Zeitoun
Model Checking Vector Addition Systems with one zero-test
https://doi.org/10.2168/LMCS-8(2:11)2012
http://arxiv.org/abs/1205.4458
2012
Log. Methods Comput. Sci.
8
2
db/journals/lmcs/lmcs8.html#abs-1205-4458
Alain Finkel
Jean Goubault-Larrecq
Forward Analysis for WSTS, Part II: Complete WSTS
https://doi.org/10.2168/LMCS-8(3:28)2012
http://arxiv.org/abs/1208.4549
2012
Log. Methods Comput. Sci.
8
3
db/journals/lmcs/lmcs8.html#abs-1208-4549
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
Bounded Parikh Automata.
1691-1710
2012
23
Int. J. Found. Comput. Sci.
8
https://doi.org/10.1142/S0129054112400709
db/journals/ijfcs/ijfcs23.html#CadilhacFM12
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
Affine Parikh automata.
511-545
2012
46
RAIRO Theor. Informatics Appl.
4
https://doi.org/10.1051/ita/2012013
db/journals/ita/ita46.html#CadilhacFM12
Alain Finkel
Jean Goubault-Larrecq
The Theory of WSTS: The Case of Complete WSTS.
3-31
2012
Petri Nets
https://doi.org/10.1007/978-3-642-31131-4_2
conf/apn/2012
db/conf/apn/pn2012.html#FinkelG12
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
Unambiguous Constrained Automata.
239-250
2012
Developments in Language Theory
https://doi.org/10.1007/978-3-642-31653-1_22
conf/dlt/2012
db/conf/dlt/dlt2012.html#CadilhacFM12
Rémi Bonnet
Alain Finkel
M. Praveen
Extending the Rackoff technique to Affine nets.
301-312
2012
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2012.301
conf/fsttcs/2012
db/conf/fsttcs/fsttcs2012.html#BonnetFP12
Alain Finkel
Jérôme Leroux
Igor Potapov
Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings
7550
2012
Springer
Lecture Notes in Computer Science
https://doi.org/10.1007/978-3-642-33512-9
978-3-642-33511-2
RP
db/conf/rp/rp2012.html
Pierre Chambart
Alain Finkel
Sylvain Schmitz
Forward Analysis and Model Checking for Trace Bounded WSTS.
49-68
2011
Petri Nets
https://doi.org/10.1007/978-3-642-21834-7_4
conf/apn/2011
db/conf/apn/pn2011.html#ChambartFS11
Rémi Bonnet
Alain Finkel
Serge Haddad
Fernando Rosa-Velardo
Ordinal Theory for Expressiveness of Well Structured Transition Systems.
153-167
2011
FoSSaCS
https://doi.org/10.1007/978-3-642-19805-2_11
https://www.wikidata.org/entity/Q57831216
conf/fossacs/2011
db/conf/fossacs/fossacs2011.html#BonnetFHR11
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
On the Expressiveness of Parikh Automata and Related Models.
103-119
2011
NCMA
conf/ncma/2011
db/conf/ncma/ncma2011.html#CadilhacFM11
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
Bounded Parikh Automata
WORDS
2011
93-102
https://doi.org/10.4204/EPTCS.63.13
http://arxiv.org/abs/1108.3625
journals/corr/abs-1108-3412
db/series/eptcs/eptcs63.html#abs-1108-3625
Michaël Cadilhac
Alain Finkel
Pierre McKenzie
Storming the Parikh Automaton
http://arxiv.org/abs/1101.1547
2011
CoRR
abs/1101.1547
db/journals/corr/corr1101.html#abs-1101-1547
Stéphane Demri
Alain Finkel
Valentin Goranko
Govert van Drimmelen
Model-checking CTL* over flat Presburger counter systems.
313-344
2010
20
J. Appl. Non Class. Logics
4
https://doi.org/10.3166/jancl.20.313-344
db/journals/jancl/jancl20.html#DemriFGD10
Rémi Bonnet
Alain Finkel
Jérôme Leroux
Marc Zeitoun
Place-Boundedness for Vector Addition Systems with one zero-test.
192-203
2010
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2010.192
conf/fsttcs/2010
db/conf/fsttcs/fsttcs2010.html#BonnetFLZ10
Alain Finkel
Arnaud Sangnier
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test.
394-406
2010
SOFSEM
https://doi.org/10.1007/978-3-642-11266-9_33
conf/sofsem/2010
db/conf/sofsem/sofsem2010.html#FinkelS10
Pierre Chambart
Alain Finkel
Sylvain Schmitz
Forward Analysis and Model Checking for Bounded WSTS
http://arxiv.org/abs/1004.2802
2010
CoRR
abs/1004.2802
db/journals/corr/corr1004.html#abs-1004-2802
Alain Finkel
Jean Goubault-Larrecq
Forward Analysis for WSTS, Part II: Complete WSTS.
188-199
2009
ICALP (2)
https://doi.org/10.1007/978-3-642-02930-1_16
conf/icalp/2009-2
db/conf/icalp/icalp2009-2.html#FinkelG09
Alain Finkel
Jean Goubault-Larrecq
Forward Analysis for WSTS, Part I: Completions.
433-444
2009
STACS
https://doi.org/10.4230/LIPIcs.STACS.2009.1844
conf/stacs/2009
db/conf/stacs/stacs2009.html#FinkelG09
Florent Bouchy
Alain Finkel
Pierluigi San Pietro
Dense-choice Counter Machines revisited
INFINITY
2009
3-22
https://doi.org/10.4204/EPTCS.10.1
http://arxiv.org/abs/0911.3405
journals/corr/abs-0911-3440
db/series/eptcs/eptcs10.html#abs-0911-3405
Emmanuelle Encrenaz
Alain Finkel
Automatic Verification of Counter Systems With Ranking Function.
85-103
2009
conf/infinity/2006-07-08
INFINITY
https://doi.org/10.1016/j.entcs.2009.05.032
db/journals/entcs/entcs239.html#EncrenazF09
Florent Bouchy
Alain Finkel
Arnaud Sangnier
Reachability in Timed Counter Systems.
167-178
2009
conf/infinity/2006-07-08
INFINITY
https://doi.org/10.1016/j.entcs.2009.05.038
db/journals/entcs/entcs239.html#BouchyFS09
Alain Finkel
Jean Goubault-Larrecq
Forward analysis for WSTS, Part I: Completions
http://arxiv.org/abs/0902.1587
2009
CoRR
abs/0902.1587
db/journals/corr/corr0902.html#abs-0902-1587
Sébastien Bardin
Alain Finkel
Jérôme Leroux
Laure Petrucci
FAST: acceleration from theory to practice.
401-424
2008
10
Int. J. Softw. Tools Technol. Transf.
5
https://doi.org/10.1007/s10009-008-0064-3
db/journals/sttt/sttt10.html#BardinFLP08
Alain Finkel
Arnaud Sangnier
Reversal-Bounded Counter Machines Revisited.
323-334
2008
MFCS
https://doi.org/10.1007/978-3-540-85238-4_26
conf/mfcs/2008
db/conf/mfcs/mfcs2008.html#FinkelS08
Florent Bouchy
Alain Finkel
Jérôme Leroux
Decomposition of Decidable First-Order Logics over Integers and Reals.
147-155
2008
TIME
https://doi.org/10.1109/TIME.2008.22
https://doi.ieeecomputersociety.org/10.1109/TIME.2008.22
conf/time/2008
db/conf/time/time2008.html#BouchyFL08
Alain Finkel
Jérôme Leroux
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
http://arxiv.org/abs/0812.1951
2008
CoRR
abs/0812.1951
db/journals/corr/corr0812.html#abs-0812-1951
Florent Bouchy
Alain Finkel
Jérôme Leroux
Decomposition of Decidable First-Order Logics over Integers and Reals
http://arxiv.org/abs/0812.1967
2008
CoRR
abs/0812.1967
db/journals/corr/corr0812.html#abs-0812-1967
Alain Finkel
Étienne Lozes
Arnaud Sangnier
Towards Model-Checking Programs with Lists.
56-86
2007
ILC
https://doi.org/10.1007/978-3-642-03092-5_6
conf/ilc/2007
db/conf/ilc/ilc2007.html#FinkelLS07
Alain Finkel
Gilles Geeraerts
Jean-François Raskin
Laurent Van Begin
On the omega-language expressive power of extended Petri nets.
374-386
2006
356
Theor. Comput. Sci.
3
https://doi.org/10.1016/j.tcs.2006.02.008
db/journals/tcs/tcs356.html#FinkelGRB06
Stéphane Demri
Alain Finkel
Valentin Goranko
Govert van Drimmelen
Towards a Model-Checker for Counter Systems.
493-507
2006
conf/atva/2006
ATVA
https://doi.org/10.1007/11901914_36
db/conf/atva/atva2006.html#DemriFGD06
Gérard Cécé
Alain Finkel
Verification of programs with half-duplex communication.
166-190
2005
202
Inf. Comput.
2
https://doi.org/10.1016/j.ic.2005.05.006
db/journals/iandc/iandc202.html#CeceF05
Alain Finkel
Jérôme Leroux
The convex hull of a regular set of integer vectors is polyhedral and effectively computable.
30-35
2005
96
Inf. Process. Lett.
1
https://doi.org/10.1016/j.ipl.2005.04.004
db/journals/ipl/ipl96.html#FinkelL05
Sébastien Bardin
Alain Finkel
Jérôme Leroux
Philippe Schnoebelen
Flat Acceleration in Symbolic Model Checking.
474-488
2005
conf/atva/2005
ATVA
https://doi.org/10.1007/11562948_35
db/conf/atva/atva2005.html#BardinFLS05
Alain Finkel
Pierre McKenzie
Claudine Picaronny
A well-structured framework for analysing petri net extensions.
1-29
2004
195
Inf. Comput.
1-2
https://doi.org/10.1016/j.ic.2004.01.005
db/journals/iandc/iandc195.html#FinkelMP04
Sébastien Bardin
Alain Finkel
Composition of Accelerations to Verify Infinite Heterogeneous Systems.
248-262
https://doi.org/10.1007/978-3-540-30476-0_22
2004
conf/atva/2004
ATVA
db/conf/atva/atva2004.html#BardinF04
Alain Finkel
Jérôme Leroux
Image Computation in Infinite State Model Checking.
361-371
https://doi.org/10.1007/978-3-540-27813-9_28
2004
conf/cav/2004
CAV
db/conf/cav/cav2004.html#FinkelL04
Alain Finkel
Jérôme Leroux
Polynomial Time Image Computation with Interval-Definable Counters Systems.
182-197
https://doi.org/10.1007/978-3-540-24732-6_14
2004
conf/spin/2004
SPIN
db/conf/spin/spin2004.html#FinkelL04
Sébastien Bardin
Alain Finkel
Jérôme Leroux
FASTer Acceleration of Counter Automata in Practice.
576-590
https://doi.org/10.1007/978-3-540-24730-2_42
2004
conf/tacas/2004
TACAS
db/conf/tacas/tacas2004.html#BardinFL04
Christophe Darlot
Alain Finkel
Laurent Van Begin
About Fast and TReX Accelerations.
87-103
2004
conf/avocs/2004
AVoCS
https://doi.org/10.1016/j.entcs.2005.04.006
db/conf/avocs/avocs2004.html#DarlotFB05
Alain Finkel
Gilles Geeraerts
Jean-François Raskin
Laurent Van Begin
On the omega-language Expressive Power of Extended Petri Nets.
87-101
2004
conf/express/2004
EXPRESS
https://doi.org/10.1016/j.entcs.2004.11.030
db/conf/express/express2004.html#FinkelGRB05
Alain Finkel
S. Purushothaman Iyer
Grégoire Sutre
Well-abstracted transition systems: application to FIFO automata.
1-31
2003
181
Inf. Comput.
1
https://doi.org/10.1016/S0890-5401(02)00027-5
db/journals/iandc/iandc181.html#FinkelIS03
Sébastien Bardin
Alain Finkel
Jérôme Leroux
Laure Petrucci
FAST: Fast Acceleration of Symbolikc Transition Systems.
118-121
https://doi.org/10.1007/978-3-540-45069-6_12
2003
conf/cav/2003
CAV
db/conf/cav/cav2003.html#BardinFLP03
Alain Finkel
Jérôme Leroux
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.
145-156
2002
conf/fsttcs/2002
FSTTCS
https://doi.org/10.1007/3-540-36206-1_14
db/conf/fsttcs/fsttcs2002.html#FinkelL02
Frédéric Herbreteau
Franck Cassez
Alain Finkel
Olivier F. Roux
Grégoire Sutre
Verification of Embedded Reactive Fiffo Systems.
400-414
2002
conf/latin/2002
LATIN
https://doi.org/10.1007/3-540-45995-2_36
db/conf/latin/latin2002.html#HerbreteauCFRS02
Alain Finkel
Jean-François Raskin
Mathias Samuelides
Laurent Van Begin
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
2002
conf/infinity/2002
INFINITY
https://doi.org/10.1016/S1571-0661(04)80535-8
db/conf/infinity/infinity2002.html#FinkelRSB02
85-106
Béatrice Bérard
Michel Bidoit
Alain Finkel
François Laroussinie
Antoine Petit 0001
Laure Petrucci
Philippe Schnoebelen
Pierre McKenzie
Systems and Software Verification, Model-Checking Techniques and Tools.
Springer
2001
978-3-642-07478-3
978-3-662-04558-9
9783540415237
https://doi.org/10.1007/978-3-662-04558-9
https://www.worldcat.org/oclc/46809889
I-XII, 1-190
Alain Finkel
Philippe Schnoebelen
Well-structured transition systems everywhere!
63-92
2001
256
Theor. Comput. Sci.
1-2
db/journals/tcs/tcs256.html#FinkelS01
https://doi.org/10.1016/S0304-3975(00)00102-X
Gérard Berry
Hubert Comon
Alain Finkel
Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings
CAV
Lecture Notes in Computer Science
2102
Springer
2001
3-540-42345-1
https://doi.org/10.1007/3-540-44585-4
db/conf/cav/cav2001.html
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.
221-227
2000
74
Inf. Process. Lett.
5-6
db/journals/ipl/ipl74.html#BouajjaniEFMRWW00
https://doi.org/10.1016/S0020-0190(00)00055-7
Alain Finkel
S. Purushothaman Iyer
Grégoire Sutre
Well-Abstracted Transition Systems.
566-580
https://doi.org/10.1007/3-540-44618-4_40
2000
conf/concur/2000
CONCUR
db/conf/concur/concur2000.html#FinkelIS00
Alain Finkel
Grégoire Sutre
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS.
353-362
https://doi.org/10.1007/3-540-44612-5_31
2000
conf/mfcs/2000
MFCS
db/conf/mfcs/mfcs2000.html#FinkelS00
Alain Finkel
Grégoire Sutre
Decidability of Reachability Problems for Classes of Two Counters Automata.
346-357
2000
conf/stacs/2000
STACS
https://doi.org/10.1007/3-540-46541-3_29
db/conf/stacs/stacs2000.html#FinkelS00
Catherine Dufourd
Alain Finkel
A Polynomial-Bisimilar Normalization for Reset Petri Nets.
187-194
1999
222
Theor. Comput. Sci.
1-2
db/journals/tcs/tcs222.html#DufourdF99
https://doi.org/10.1016/S0304-3975(98)00351-X
Javier Esparza
Alain Finkel
Richard Mayr
On the Verification of Broadcast Protocols.
352-359
1999
conf/lics/1999
LICS
https://doi.org/10.1109/LICS.1999.782630
https://doi.ieeecomputersociety.org/10.1109/LICS.1999.782630
db/conf/lics/lics99.html#EsparzaFM99
Christophe Collet 0002
Alain Finkel
Rachid Gherbi
CapRe: a Gaze Tracking System in Man-machine Interaction.
77-81
1998
2
J. Adv. Comput. Intell. Intell. Informatics
3
https://doi.org/10.20965/jaciii.1998.p0077
db/journals/jaciii/jaciii2.html#ColletFG98
Grégoire Sutre
Alain Finkel
Olivier F. Roux
Franck Cassez
Effective Recognizability and Model Checking of Reactive Fiffo Automata.
106-123
1998
conf/amast/1998
AMAST
https://doi.org/10.1007/3-540-49253-4_10
db/conf/amast/amast98.html#SutreFRC98
Catherine Dufourd
Alain Finkel
Philippe Schnoebelen
Reset Nets Between Decidability and Undecidability.
103-115
https://doi.org/10.1007/BFb0055044
1998
conf/icalp/1998
ICALP
db/conf/icalp/icalp98.html#DufourdFS98
Alain Finkel
Philippe Schnoebelen
Fundamental Structures in Well-Structured Infinite Transition Systems.
102-118
https://doi.org/10.1007/BFb0054314
1998
conf/latin/1998
LATIN
db/conf/latin/latin98.html#FinkelS98
Alain Finkel
Pierre McKenzie
Verifying Identical Communicating Processes is Undecidable.
217-230
1997
174
Theor. Comput. Sci.
1-2
db/journals/tcs/tcs174.html#FinkelM97
https://doi.org/10.1016/S0304-3975(96)00026-6
Gérard Cécé
Alain Finkel
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract).
304-315
1997
conf/cav/1997
CAV
db/conf/cav/cav97.html#CeceF97
https://doi.org/10.1007/3-540-63166-6_31
Catherine Dufourd
Alain Finkel
Polynomial-Time Manz-One Reductions for Petri Nets.
312-326
https://doi.org/10.1007/BFb0058039
1997
conf/fsttcs/1997
FSTTCS
db/conf/fsttcs/fsttcs97.html#DufourdF97
Zakaria Bouziane
Alain Finkel
Cyclic Petri net reachability sets are semi-linear effectively constructible.
1997
conf/infinity/1997
INFINITY
https://doi.org/10.1016/S1571-0661(05)80423-2
db/journals/entcs/entcs9.html#BouzianeF97
15-24
Alain Finkel
Bernard Willems
Pierre Wolper
A direct symbolic approach to model checking pushdown systems.
1997
conf/infinity/1997
INFINITY
https://doi.org/10.1016/S1571-0661(05)80426-8
db/journals/entcs/entcs9.html#FinkelWW97
27-37
Gérard Cécé
Alain Finkel
S. Purushothaman Iyer
Unreliable Channels are Easier to Verify Than Perfect Channels.
20-31
1996
124
Inf. Comput.
1
db/journals/iandc/iandc124.html#CeceFI96
https://doi.org/10.1006/inco.1996.0003
Alain Finkel
Isabelle Tellier
A Polynomial Algorithm for the Membership Problem with Categorial Grammars.
207-221
1996
164
Theor. Comput. Sci.
1&2
db/journals/tcs/tcs164.html#FinkelT96
https://doi.org/10.1016/0304-3975(95)00211-1
Alain Finkel
Decidability of the Termination Problem for Completely Specified Protocols.
129-135
1994
7
Distributed Comput.
3
db/journals/dc/dc7.html#Finkel94
https://doi.org/10.1007/BF02277857
Alain Finkel
Laure Petrucci
Composition/décomposition de réseaux de petri et de leurs graphes de couverture.
73-124
1994
28
RAIRO Theor. Informatics Appl.
2
db/journals/ita/ita28.html#FinkelP94
https://doi.org/10.1051/ita/1994280200731
Gérard Cécé
Alain Finkel
S. Purushothaman Iyer
Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.
35-43
1994
conf/sigsoft/1994
SIGSOFT FSE
https://doi.org/10.1145/193173.195292
https://doi.org/10.1145/195274.195292
db/conf/sigsoft/fse94.html#CeceFI94
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
STACS
Lecture Notes in Computer Science
665
Springer
1993
https://doi.org/10.1007/3-540-56503-5
db/conf/stacs/stacs93.html
3-540-56503-5
Alain Finkel
Matthias Jantzen
STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings
STACS
Lecture Notes in Computer Science
577
Springer
1992
https://doi.org/10.1007/3-540-55210-3
db/conf/stacs/stacs92.html
3-540-55210-3
Alain Finkel
The Minimal Coverability Graph for Petri Nets.
210-243
1991
conf/apn/1991
Applications and Theory of Petri Nets
db/conf/apn/apn91.html#Funkel91
https://doi.org/10.1007/3-540-56689-9_45
Alain Finkel
Laure Petrucci
Avoiding State Exposion by Composition of Minimal Covering Graphs.
169-180
1991
conf/cav/1991
CAV
db/conf/cav/cav91.html#FinkelP91
https://doi.org/10.1007/3-540-55179-4_17
Reduction and covering of infinite reachability trees
Alain Finkel
144-179
Inf. Comput.
December
1990
89
2
db/journals/iandc/iandc89.html#Finkel90
https://doi.org/10.1016/0890-5401(90)90009-7
Alain Finkel
Annie Choquet
Fifo Nets Without Order Deadlock.
15-36
1988
25
Acta Informatica
1
db/journals/acta/acta25.html#FinkelC87
https://doi.org/10.1007/BF00268843
Alain Finkel
Louis E. Rosier
A Survey on the Decidability Questions for Classes of FIFO Nets.
106-132
1987
conf/apn/1987
European Workshop on Applications and Theory of Petri Nets
db/conf/apn/apn1987.html#FinkelR87
https://doi.org/10.1007/3-540-50580-6_26
Alain Finkel
A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems.
499-508
1987
conf/icalp/1987
ICALP
db/conf/icalp/icalp87.html#Finkel87
https://doi.org/10.1007/3-540-18088-5_43
Annie Choquet
Alain Finkel
Applications of residues for the analysis of parallel systems communicating by fifo channels.
44-56
1986
30
Bull. EATCS
db/journals/eatcs/eatcs30.html#ChoquetF86
Gérard Memmi
Alain Finkel
An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets.
191-214
1985
35
Theor. Comput. Sci.
db/journals/tcs/tcs35.html#MemmiF85
https://doi.org/10.1016/0304-3975(85)90014-3
Alain Finkel
Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis.
137-142
1985
38
Theor. Comput. Sci.
db/journals/tcs/tcs38.html#Finkel85
https://doi.org/10.1016/0304-3975(85)90216-6
Alain Finkel
Petri Nets and monogenous FIFO nets.
28-30
1984
23
Bull. EATCS
db/journals/eatcs/eatcs23.html#Finkel84
Alain Finkel
Blocage et vivacité dans les réseaux a pile-file.
151-162
1984
conf/stacs/1984
STACS
db/conf/stacs/stacs84.html#Finkel84
https://doi.org/10.1007/3-540-12920-0_14
Alain Finkel
Gérard Memmi
Fifo nets: a new model of parallel computation.
111-121
1983
conf/tcs/1983
Theoretical Computer Science
db/conf/tcs/tcs1983.html#FinkelM83
https://doi.org/10.1007/BFb0009638
Parosh Aziz Abdulla
Benoît Barbot
Sébastien Bardin
Laurent Van Begin
Béatrice Bérard
Gérard Berry
Michel Bidoit
Michael Blondin
Benedikt Bollig
Rémi Bonnet
Ahmed Bouajjani
Florent Bouchy
Zakaria Bouziane
Michaël Cadilhac
Franck Cassez
Gérard Cécé
Pierre Chambart
Raphaël Chane-Yack-Fa
Annie Choquet-GenietAnnie Choquet
Christophe Collet 0002
Hubert Comon-LundhHubert Comon
Gustave Cortal
Christophe Darlot
Stéphane Demri
Govert van Drimmelen
Catherine Dufourd
Emmanuelle Encrenaz-TiphèneEmmanuelle Encrenaz
Matthias Englert
Patrice Enjalbert
Javier Esparza
Marc Frappier
Gilles Geeraerts
Rachid Gherbi
Cinzia Di Giusto
Stefan Göller
Valentin Goranko
Jean Goubault-Larrecq
Ekanshdeep Gupta
Christoph Haase
Serge Haddad
Frédéric Herbreteau
Mathieu Hilaire
S. Purushothaman Iyer
Matthias Jantzen
Igor Khmelnitsky
S. Krishna 0004Shankara Narayanan Krishna
François Laroussinie
Laetitia Laversa
Ranko Lazic 0001
Jérôme Leroux
Martin Leucker
Étienne Lozes
Khushraj Madnani
Rupak Majumdar
Oded Maler
Amel Mammar
Richard Mayr
Pierre McKenzie
Gérard Memmi
Daniel Neider
Joël Ouaknine
Patrick Paroubek
Antoine Petit 0001
Laure Petrucci
Claudine Picaronny
Pierluigi San Pietro
Igor Potapov
M. Praveen
Jean-François Raskin
Fernando Rosa-Velardo
Louis E. Rosier
Peter Rossmanith
Olivier F. Roux
Rajarshi Roy 0002
Mathias Samuelides
Arnaud Sangnier
Sylvain Schmitz
Philippe Schnoebelen
Amrita Suresh
Grégoire Sutre
Isabelle Tellier
Patrick Totzke
Klaus W. Wagner
Bernard Willems
Pierre Wolper
Xuan Xie
Lina Ye
Marc Zeitoun
Georg Zetzsche