Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Finkel, Alain"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Handling infinitely branching WSTS
Michael Blondin
,
Alain Finkel
,
Pierre McKenzie
Lecture Notes in Computer Science
8573
, 2014, pp. 13-25
Dense-choice counter machines revisited
Florent Bouchy
,
Alain Finkel
,
Pierluigi San Pietro
Theoretical Computer Science
542
, 2014, pp. 17-31
Ordinal theory for expressiveness of well-structured transition systems
Rémi Bonnet
,
Alain Finkel
,
Serge Haddad
,
Fernando Rosa-Velardo
Information and Computation
224
, 2013, pp. 1-22
Unambiguous constrained automata
Michaël Cadilhac
,
Alain Finkel
,
Pierre McKenzie
International Journal of Foundations of Computer Science
24
(7), 2013, pp. 1099-1116
Reachability in register machines with polynomial updates
Alain Finkel
,
Stefan Göller
,
Christoph Haase
Lecture Notes in Computer Science
8087
, 2013, pp. 409-420
Extending the Rackoff technique to Affine nets
Rémi Bonnet
,
Alain Finkel
,
M. Praveen
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 301-312
Bounded Parikh automata
Michaël Cadilhac
,
Alain Finkel
,
Pierre McKenzie
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1691-1709
The theory of WSTS: The case of complete WSTS
Alain Finkel
,
Jean Goubault-Larrecq
Lecture Notes in Computer Science
7347
, 2012, pp. 3-31
Forward analysis and model checking for trace bounded WSTS
Pierre Chambart
,
Alain Finkel
,
Sylvain Schmitz
Lecture Notes in Computer Science
6709
, 2011, pp. 49-68
Place-boundedness for vector addition systems with one zero-test
Rémi Bonnet
,
Alain Finkel
,
Jérôme Leroux
,
Marc Zeitoun
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 192-203
Forward analysis for WSTS, Part II: Complete WSTS
Alain Finkel
,
Jean Goubault-Larrecq
Lecture Notes in Computer Science
5556
, 2009, pp. 188-199
Forward analysis for WSTS, part I: Completions
Alain Finkel
,
Jean Goubault-Larrecq
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 433-444
Reversal-bounded counter machines revisited
Alain Finkel
,
Arnaud Sangnier
Lecture Notes in Computer Science
5162
, 2008, pp. 323-334
Verification of progarams with half-duplex communicaton
Gérard Cécé
,
Alain Finkel
Information and Computation
202
(2), 2005, pp. 166-190
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Alain Finkel
,
Jérôme Leroux
Information Processing Letters
96
(1), 2005, pp. 30-35
A well-structured framework for analysing Petri net extensions
Alain Finkel
,
Pierre McKenzie
,
Claudine Picaronny
Information and Computation
195
(1-2), 2004, pp. 1-29
Well-abstracted transition systems: Application to FIFO automata
Alain Finkel
,
S. Purushothaman Iyer
,
Grégoire Sutre
Information and Computation
181
(1), 2003, pp. 1-31
How to compose Presburger-accelerations: Applications to broadcast protocols
Alain Finkel
,
Jérôme Leroux
Lecture Notes in Computer Science
2556
, 2002, pp. 145-156
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
Information Processing Letters
74
(5-6), 2000, pp. 221-227
Decidability of reachability problems for classes of two counters automata
Alain Finkel
,
Grégoire Sutre
Lecture Notes in Computer Science
1770
, 2000, pp. 346-357
A polynomial
\lambda
-bisimilar normalization for reset Petri nets
Catherine Dufourd
,
Alain Finkel
Theoretical Computer Science
222
(1-2), 1999, pp. 187-194
Fundamental structures in well-structured infinite transition systems
Alain Finkel
,
Philippe Schnoebelen
Lecture Notes in Computer Science
1380
, 1998, pp. 102-118
Polynomial-time many-one reductions for Petri nets
Catherine Dufourd
,
Alain Finkel
Lecture Notes in Computer Science
1346
, 1997, pp. 312-326
Verifying identical communicating processes is undecidable
Alain Finkel
,
Pierre McKenzie
Theoretical Computer Science
174
(1-2), 1997, pp. 217-230
Unreliabable channels are easier to verify than perfect channels
Gérard Cécé
,
Alain Finkel
,
S. Purushothaman Iyer
Information and Computation
124
(1), 1996, pp. 20-31
Seiten 1
2
>