( en | de | ru )

 

Disambiguation of "Finkel, Alain"

Author of the publication

copydeleteadd this publication to your clipboard
Well-abstracted transition systems: application to FIFO automata.

, , and . Inf. Comput., 181 (1): 1-31 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Asher Finkel

Michael Finkel

Carola Finkel

Ariana Finkel

Asher Finkel

 

Other publications of authors with the same name

Model-checking CTL* over flat Presburger counter systems., , , and . J. Appl. Non Class. Logics, 20 (4): 313-344 (2010)Composition/décomposition de réseaux de petri et de leurs graphes de couverture., and . RAIRO Theor. Informatics Appl., 28 (2): 73-124 (1994)Avoiding State Exposion by Composition of Minimal Covering Graphs., and . CAV, volume 575 of Lecture Notes in Computer Science, page 169-180. Springer, (1991)Ordinal Theory for Expressiveness of Well Structured Transition Systems., , , and . FoSSaCS, volume 6604 of Lecture Notes in Computer Science, page 153-167. Springer, (2011)Well-Abstracted Transition Systems., , and . CONCUR, volume 1877 of Lecture Notes in Computer Science, page 566-580. Springer, (2000)A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems.. ICALP, volume 267 of Lecture Notes in Computer Science, page 499-508. Springer, (1987)Reset Nets Between Decidability and Undecidability., , and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 103-115. Springer, (1998)Dense-choice Counter Machines revisited., , and . Theor. Comput. Sci., (2014)Forward Analysis for WSTS, Part III: Karp-Miller Trees., , and . Log. Methods Comput. Sci., (2020)From Well Structured Transition Systems to Program Verification.. VPT/HCVS@ETAPS, volume 320 of EPTCS, page 44-49. (2020)