The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alain Finkel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Grégoire Sutre, Alain Finkel, Olivier Roux, Franck Cassez
    Effective Recognizability and Model Checking of Reactive Fiffo Automata. [Citation Graph (0, 0)][DBLP]
    AMAST, 1998, pp:106-123 [Conf]
  2. Alain Finkel, Louis E. Rosier
    A Survey on the Decidability Questions for Classes of FIFO Nets. [Citation Graph (0, 0)][DBLP]
    European Workshop on Applications and Theory of Petri Nets, 1987, pp:106-132 [Conf]
  3. Alain Finkel
    The Minimal Coverability Graph for Petri Nets. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1991, pp:210-243 [Conf]
  4. Sébastien Bardin, Alain Finkel
    Composition of Accelerations to Verify Infinite Heterogeneous Systems. [Citation Graph (0, 0)][DBLP]
    ATVA, 2004, pp:248-262 [Conf]
  5. Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen
    Flat Acceleration in Symbolic Model Checking. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:474-488 [Conf]
  6. Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
    Towards a Model-Checker for Counter Systems. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:493-507 [Conf]
  7. Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
    FAST: Fast Acceleration of Symbolikc Transition Systems. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:118-121 [Conf]
  8. Gérard Cécé, Alain Finkel
    Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:304-315 [Conf]
  9. Alain Finkel, Jérôme Leroux
    Image Computation in Infinite State Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:361-371 [Conf]
  10. Alain Finkel, Laure Petrucci
    Avoiding State Exposion by Composition of Minimal Covering Graphs. [Citation Graph (0, 0)][DBLP]
    CAV, 1991, pp:169-180 [Conf]
  11. Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
    Well-Abstracted Transition Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:566-580 [Conf]
  12. Catherine Dufourd, Alain Finkel
    Polynomial-Time Manz-One Reductions for Petri Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:312-326 [Conf]
  13. Alain Finkel, Jérôme Leroux
    How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:145-156 [Conf]
  14. Catherine Dufourd, Alain Finkel, Ph. Schnoebelen
    Reset Nets Between Decidability and Undecidability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:103-115 [Conf]
  15. Alain Finkel
    A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:499-508 [Conf]
  16. Alain Finkel, Ph. Schnoebelen
    Fundamental Structures in Well-Structured Infinite Transition Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:102-118 [Conf]
  17. Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier Roux, Grégoire Sutre
    Verification of Embedded Reactive Fiffo Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:400-414 [Conf]
  18. Javier Esparza, Alain Finkel, Richard Mayr
    On the Verification of Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:352-359 [Conf]
  19. Alain Finkel, Grégoire Sutre
    An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:353-362 [Conf]
  20. Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
    Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 1994, pp:35-43 [Conf]
  21. Alain Finkel, Jérôme Leroux
    Polynomial Time Image Computation with Interval-Definable Counters Systems. [Citation Graph (0, 0)][DBLP]
    SPIN, 2004, pp:182-197 [Conf]
  22. Alain Finkel
    Blocage et vivacité dans les réseaux a pile-file. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:151-162 [Conf]
  23. Alain Finkel, Grégoire Sutre
    Decidability of Reachability Problems for Classes of Two Counters Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:346-357 [Conf]
  24. Sébastien Bardin, Alain Finkel, Jérôme Leroux
    FASTer Acceleration of Counter Automata in Practice. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:576-590 [Conf]
  25. Alain Finkel, Gérard Memmi
    Fifo nets: a new model of parallel computation. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:111-121 [Conf]
  26. Alain Finkel, Annie Choquet
    Fifo Nets Without Order Deadlock. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:25, n:1, pp:15-36 [Journal]
  27. Alain Finkel
    Decidability of the Termination Problem for Completely Specified Protocols. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1994, v:7, n:3, pp:129-135 [Journal]
  28. Annie Choquet, Alain Finkel
    Applications of residues for the analysis of parallel systems communicating by fifo channels. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1986, v:30, n:, pp:44-56 [Journal]
  29. Alain Finkel
    Petri Nets and monogenous FIFO nets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:23, n:, pp:28-30 [Journal]
  30. Zakaria Bouziane, Alain Finkel
    Cyclic Petri net reachability sets are semi-linear effectively constructible. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
  31. Christophe Darlot, Alain Finkel, Laurent Van Begin
    About Fast and TReX Accelerations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:6, pp:87-103 [Journal]
  32. Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    On the omega-language Expressive Power of Extended Petri Nets. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:2, pp:87-101 [Journal]
  33. Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin
    Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:6, pp:- [Journal]
  34. Alain Finkel, Bernard Willems, Pierre Wolper
    A direct symbolic approach to model checking pushdown systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
  35. Gérard Cécé, Alain Finkel
    Verification of programs with half-duplex communication. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:2, pp:166-190 [Journal]
  36. Gérard Cécé, Alain Finkel, S. Purushothaman Iyer
    Unreliable Channels are Easier to Verify Than Perfect Channels. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:124, n:1, pp:20-31 [Journal]
  37. Alain Finkel
    Reduction and covering of infinite reachability trees [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:89, n:2, pp:144-179 [Journal]
  38. Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
    Well-abstracted transition systems: application to FIFO automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:181, n:1, pp:1-31 [Journal]
  39. Alain Finkel, Pierre McKenzie, Claudine Picaronny
    A well-structured framework for analysing petri net extensions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:195, n:1-2, pp:1-29 [Journal]
  40. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:221-227 [Journal]
  41. Alain Finkel, Jérôme Leroux
    The convex hull of a regular set of integer vectors is polyhedral and effectively computable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:1, pp:30-35 [Journal]
  42. Alain Finkel, Laure Petrucci
    Composition/décomposition de réseaux de petri et de leurs graphes de couverture. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:2, pp:73-124 [Journal]
  43. Christophe Collet, Alain Finkel, Rachid Gherbi
    CapRe: a Gaze Tracking System in Man-machine Interaction. [Citation Graph (0, 0)][DBLP]
    JACIII, 1998, v:2, n:3, pp:77-81 [Journal]
  44. Catherine Dufourd, Alain Finkel
    A Polynomial-Bisimilar Normalization for Reset Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:222, n:1-2, pp:187-194 [Journal]
  45. Alain Finkel
    Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:137-142 [Journal]
  46. Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    On the omega-language expressive power of extended Petri nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:3, pp:374-386 [Journal]
  47. Alain Finkel, Pierre McKenzie
    Verifying Identical Communicating Processes is Undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:217-230 [Journal]
  48. Alain Finkel, Ph. Schnoebelen
    Well-structured transition systems everywhere! [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:256, n:1-2, pp:63-92 [Journal]
  49. Alain Finkel, Isabelle Tellier
    A Polynomial Algorithm for the Membership Problem with Categorial Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:207-221 [Journal]
  50. Gérard Memmi, Alain Finkel
    An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:191-214 [Journal]

  51. Forward Analysis for WSTS, Part II: Complete WSTS. [Citation Graph (, )][DBLP]


  52. Reversal-Bounded Counter Machines Revisited. [Citation Graph (, )][DBLP]


  53. Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. [Citation Graph (, )][DBLP]


  54. Forward Analysis for WSTS, Part I: Completions. [Citation Graph (, )][DBLP]


  55. Decomposition of Decidable First-Order Logics over Integers and Reals. [Citation Graph (, )][DBLP]


  56. Towards Model-Checking Programs with Lists. [Citation Graph (, )][DBLP]


  57. The convex hull of a regular set of integer vectors is polyhedral and effectively computable [Citation Graph (, )][DBLP]


  58. Decomposition of Decidable First-Order Logics over Integers and Reals [Citation Graph (, )][DBLP]


  59. Forward analysis for WSTS, Part I: Completions [Citation Graph (, )][DBLP]


  60. Dense-choice Counter Machines revisited [Citation Graph (, )][DBLP]


  61. Forward Analysis and Model Checking for Bounded WSTS [Citation Graph (, )][DBLP]


  62. Reachability in Timed Counter Systems. [Citation Graph (, )][DBLP]


  63. Automatic Verification of Counter Systems With Ranking Function. [Citation Graph (, )][DBLP]


Search in 9.097secs, Finished in 9.100secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002