pr\u00e9sentent<\/p>\n\n\n\n
Autoris\u00e9 \u00e0 pr\u00e9senter ses travaux en vue de l\u2019obtention du Doctorat de l’Institut Polytechnique de Paris, pr\u00e9par\u00e9 \u00e0 l’Institut Polytechnique de Paris T\u00e9l\u00e9com SudParis en :<\/p>\n\n\n\n
le JEUDI 5 NOVEMBRE 2026 \u00e0 10h00<\/p>\n\n\n\n
\u00e0<\/p>\n\n\n\n
Amphith\u00e9\u00e2tre 6
19 Place Marguerite Perey, 91120 Palaiseau<\/p>\n\n\n\n
Membres du jury :<\/strong><\/p>\n\n\n\n Mme Natalia KUSHIK<\/strong> , Ma\u00eetresse de conf\u00e9rences, T\u00e9l\u00e9com SudParis \/ Institut Polytechnique de Paris, FRANCE – Directrice de th\u00e8se R\u00e9sum\u00e9 :<\/strong><\/p>\n\n\n\n Les s\u00e9quences d\u2019identification d\u2019\u00e9tat pour les machines \u00e0 \u00e9tats finis (Finite State Machines, FSMs) ont fait l\u2019objet de nombreuses recherches au cours des derni\u00e8res d\u00e9cennies. Les s\u00e9quences de synchronisation (synchronizing and homing sequences) permettent de ramener une FSM non initialis\u00e9e dans un \u00e9tat courant connu, tandis que l\u2019\u00e9tat initial peut \u00eatre d\u00e9termin\u00e9 au moyen d\u2019une s\u00e9quence de distinction (distinguishing sequence). De nombreuses m\u00e9thodes ont \u00e9t\u00e9 propos\u00e9es pour v\u00e9rifier l\u2019existence de ces s\u00e9quences d\u2019identification d\u2019\u00e9tat et en permettre la synth\u00e8se. Bien que les FSMs classiques soient largement utilis\u00e9es pour mod\u00e9liser le comportement des syst\u00e8mes r\u00e9actifs, elles ne sont pas suffisamment expressives pour repr\u00e9senter leur comportement temporel, notamment les d\u00e9lais de traitement, les interactions asynchrones, les conditions de comp\u00e9tition (race conditions) ou d\u2019autres ph\u00e9nom\u00e8nes d\u00e9pendants du temps. C\u2019est pourquoi plusieurs mod\u00e8les temporis\u00e9s ont \u00e9t\u00e9 propos\u00e9s et \u00e9tudi\u00e9s. Dans cette th\u00e8se, nous \u00e9tudions les machines \u00e0 \u00e9tats finis temporis\u00e9es (Timed Finite State Machines, TFSMs) avec d\u00e9lais de sortie, dans lesquelles chaque transition entr\u00e9e\/sortie est enrichie d\u2019une garde temporelle et d\u2019un d\u00e9lai de sortie. Ce mod\u00e8le permet de repr\u00e9senter des proc\u00e9dures concurrentes tout en pr\u00e9servant la structure des FSMs classiques pour la mod\u00e9lisation du comportement des syst\u00e8mes r\u00e9actifs. Cette th\u00e8se s\u2019int\u00e9resse au probl\u00e8me de l\u2019identification d\u2019\u00e9tat dans les TFSMs avec d\u00e9lais de sortie et met en \u00e9vidence l\u2019int\u00e9r\u00eat des s\u00e9quences d\u2019identification d\u2019\u00e9tat pour am\u00e9liorer la fiabilit\u00e9 et l\u2019efficacit\u00e9 des syst\u00e8mes de r\u00e9seaux distribu\u00e9s et des infrastructures d\u2019informatique en nuage (cloud computing). Dans une premi\u00e8re partie, nous introduisons formellement les s\u00e9quences de synchronisation pour les TFSMs avec d\u00e9lais de sortie et en \u00e9tudions les propri\u00e9t\u00e9s. Les similitudes et les diff\u00e9rences entre les s\u00e9quences de synchronisation dans les mod\u00e8les temporis\u00e9s et non temporis\u00e9s sont analys\u00e9es. Nous d\u00e9veloppons \u00e9galement des algorithmes permettant de v\u00e9rifier l\u2019existence de telles s\u00e9quences pour une TFSM avec d\u00e9lais de sortie et d\u2019en effectuer la synth\u00e8se. Dans une deuxi\u00e8me partie, ces s\u00e9quences sont exploit\u00e9es afin de pr\u00e9venir les probl\u00e8mes de concurrence et de r\u00e9duire le temps d\u2019ex\u00e9cution des requ\u00eates dans un environnement de cloud computing, les r\u00e9sultats \u00e9tant valid\u00e9s par une \u00e9valuation exp\u00e9rimentale. La troisi\u00e8me partie est consacr\u00e9e aux s\u00e9quences de distinction pour deux TFSMs avec d\u00e9lais de sortie initialis\u00e9es. Nous en proposons une d\u00e9finition formelle, \u00e9tudions leurs propri\u00e9t\u00e9s et d\u00e9veloppons des algorithmes permettant de v\u00e9rifier leur existence ainsi que d\u2019en r\u00e9aliser la synth\u00e8se. Dans la quatri\u00e8me partie, nous examinons l\u2019applicabilit\u00e9 des s\u00e9quences de distinction propos\u00e9es au test bas\u00e9 sur les mod\u00e8les (model-based testing). Plus pr\u00e9cis\u00e9ment, nous d\u00e9rivons des suites de tests garantissant une couverture de fautes vis-\u00e0-vis des d\u00e9fauts li\u00e9s au temps, tels que les probl\u00e8mes de concurrence ou le positionnement incorrect des temporisations (timeouts). L\u2019efficacit\u00e9 des approches propos\u00e9es est valid\u00e9e au moyen d\u2019une \u00e9valuation exp\u00e9rimentale. Cette th\u00e8se apporte ainsi une contribution au domaine de l\u2019identification d\u2019\u00e9tat des mod\u00e8les temporis\u00e9s en d\u00e9montrant l\u2019applicabilit\u00e9 pratique des s\u00e9quences de synchronisation et de distinction pour am\u00e9liorer la fiabilit\u00e9 et l\u2019efficacit\u00e9 des syst\u00e8mes de r\u00e9seaux distribu\u00e9s et de cloud computing, ainsi que pour d\u00e9river des suites de tests de haute qualit\u00e9 offrant une couverture garantie contre les fautes li\u00e9es aux contraintes temporelles. State identification sequences for Finite State Machines (FSMs) have been extensively studied in the past decades. Synchronizing and homing sequences bring a non-initialized FSM to the known current state, while the initial state can be determined when a distinguishing sequence is applied. A number of methods have been proposed for the existence check and derivation of the state identification sequences. Although classical FSMs are widely-used to model the behavior of reactive systems, they are not expressive enough to represent their time-dependent behavior, such as processing delays, asynchronous interactions, race conditions, etc. Correspondingly, timed state models have been proposed and studied. In this thesis, we investigate Timed Finite State Machines (TFSMs) with output delays, where each input\/output transition is augmented with a timed guard and an output delay. Such a model enables the representation of concurrent procedures while preserving the structure of classical FSMs when modeling the behavior of reactive systems. In this thesis, the state identification problem for TFSMs with output delays is studied, and the effectiveness of using state identification sequences is shown for improving the reliability and efficiency of distributed networking and cloud computing systems. In the first part, we formally introduce synchronizing and homing sequences for TFSMs with output delays and study their properties. The similarities and differences between synchronizing and homing sequences for timed and untimed state models are investigated. We also develop algorithms for checking the existence and derivation of synchronizing and homing sequences for a TFSM with output delays. In the second part, TFSM synchronizing and homing sequences are applied for preventing concurrency and minimizing the request execution time in a cloud computing environment with relevant experimental evaluation. The third part is devoted to distinguishing sequences for two initialized TFSMs with output delays. We formally define such sequences, investigate their properties, and develop algorithms for checking the existence of such sequences and their derivation. In the fourth part, the applicability of the proposed distinguishing sequences to model-based testing is considered. In particular, we derive test suites with the guaranteed fault coverage against time-related faults, such as concurrency issues and wrongly-placed timeouts. The effectiveness of the proposed approaches is validated through an experimental evaluation. The thesis therefore contributes to the state identification for timed state models demonstrating the practical applicability of synchronizing, homing and distinguishing sequences for improving the reliability and efficiency of distributed networking and cloud computing systems, as well as for deriving high-quality test suites against time-related faults.<\/p>\n","protected":false},"excerpt":{"rendered":" L’Ecole doctorale : Ecole Doctorale de l’Institut Polytechnique de Paris et le Laboratoire de recherche SAMOVAR – Services r\u00e9partis, Architectures, Mod\u00e9lisation, Validation, Administration des R\u00e9seaux pr\u00e9sentent l\u2019AVIS DE SOUTENANCE de Monsieur Evgenii VINARSKII Autoris\u00e9 \u00e0 pr\u00e9senter ses travaux en vue de l\u2019obtention du Doctorat de l’Institut Polytechnique de Paris, pr\u00e9par\u00e9 \u00e0 l’Institut Polytechnique de Paris […]<\/p>\n","protected":false},"author":4,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ocean_front_end_style_editor":"no","ocean_post_layout":"","ocean_both_sidebars_style":"","ocean_both_sidebars_content_width":0,"ocean_both_sidebars_sidebars_width":0,"ocean_sidebar":"","ocean_second_sidebar":"","ocean_disable_margins":"enable","ocean_add_body_class":"","ocean_shortcode_before_top_bar":"","ocean_shortcode_after_top_bar":"","ocean_shortcode_before_header":"","ocean_shortcode_after_header":"","ocean_has_shortcode":"","ocean_shortcode_after_title":"","ocean_shortcode_before_footer_widgets":"","ocean_shortcode_after_footer_widgets":"","ocean_shortcode_before_footer_bottom":"","ocean_shortcode_after_footer_bottom":"","ocean_display_top_bar":"default","ocean_display_header":"default","ocean_header_style":"","ocean_center_header_left_menu":"","ocean_custom_header_template":"","ocean_custom_logo":0,"ocean_custom_retina_logo":0,"ocean_custom_logo_max_width":0,"ocean_custom_logo_tablet_max_width":0,"ocean_custom_logo_mobile_max_width":0,"ocean_custom_logo_max_height":0,"ocean_custom_logo_tablet_max_height":0,"ocean_custom_logo_mobile_max_height":0,"ocean_header_custom_menu":"","ocean_menu_typo_font_family":"","ocean_menu_typo_font_subset":"","ocean_menu_typo_font_size":0,"ocean_menu_typo_font_size_tablet":0,"ocean_menu_typo_font_size_mobile":0,"ocean_menu_typo_font_size_unit":"px","ocean_menu_typo_font_weight":"","ocean_menu_typo_font_weight_tablet":"","ocean_menu_typo_font_weight_mobile":"","ocean_menu_typo_transform":"","ocean_menu_typo_transform_tablet":"","ocean_menu_typo_transform_mobile":"","ocean_menu_typo_line_height":0,"ocean_menu_typo_line_height_tablet":0,"ocean_menu_typo_line_height_mobile":0,"ocean_menu_typo_line_height_unit":"","ocean_menu_typo_spacing":0,"ocean_menu_typo_spacing_tablet":0,"ocean_menu_typo_spacing_mobile":0,"ocean_menu_typo_spacing_unit":"","ocean_menu_link_color":"","ocean_menu_link_color_hover":"","ocean_menu_link_color_active":"","ocean_menu_link_background":"","ocean_menu_link_hover_background":"","ocean_menu_link_active_background":"","ocean_menu_social_links_bg":"","ocean_menu_social_hover_links_bg":"","ocean_menu_social_links_color":"","ocean_menu_social_hover_links_color":"","ocean_disable_title":"default","ocean_disable_heading":"default","ocean_post_title":"","ocean_post_subheading":"","ocean_post_title_style":"","ocean_post_title_background_color":"","ocean_post_title_background":0,"ocean_post_title_bg_image_position":"","ocean_post_title_bg_image_attachment":"","ocean_post_title_bg_image_repeat":"","ocean_post_title_bg_image_size":"","ocean_post_title_height":0,"ocean_post_title_bg_overlay":0.5,"ocean_post_title_bg_overlay_color":"","ocean_disable_breadcrumbs":"default","ocean_breadcrumbs_color":"","ocean_breadcrumbs_separator_color":"","ocean_breadcrumbs_links_color":"","ocean_breadcrumbs_links_hover_color":"","ocean_display_footer_widgets":"default","ocean_display_footer_bottom":"default","ocean_custom_footer_template":"","ocean_post_oembed":"","ocean_post_self_hosted_media":"","ocean_post_video_embed":"","ocean_link_format":"","ocean_link_format_target":"self","ocean_quote_format":"","ocean_quote_format_link":"post","ocean_gallery_link_images":"on","ocean_gallery_id":[],"footnotes":""},"categories":[286,549],"tags":[],"class_list":["post-7717","post","type-post","status-publish","format-standard","hentry","category-fractualites-ennews-fr","category-seminaire-acmes","entry"],"_links":{"self":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts\/7717","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/comments?post=7717"}],"version-history":[{"count":1,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts\/7717\/revisions"}],"predecessor-version":[{"id":7718,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts\/7717\/revisions\/7718"}],"wp:attachment":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media?parent=7717"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/categories?post=7717"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/tags?post=7717"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
M. Djamal ZEGHLACHE<\/strong>, Professeur, T\u00e9l\u00e9com SudParis \/ Institut Polytechnique de Paris, FRANCE – CoDirecteur de these
Mme Olga KOUCHNARENKO<\/strong>, Professeure, Universit\u00e9 Marie et Louis Pasteur, FRANCE – Rapporteur
M. Thomas CHATAIN<\/strong>, Ma\u00eetre de conf\u00e9rences, ENS Paris-Saclay, FRANCE – Rapporteur
M. Olivier BARAIS<\/strong>, Professeur, Universit\u00e9 de Rennes, FRANCE – Examinateur
M. Uli FAHRENBERG<\/strong>, Professeur, Universit\u00e9 Paris-Saclay, FRANCE – Examinateur
M. Mohamed SELLAMI<\/strong>, Ma\u00eetre de conf\u00e9rences, T\u00e9l\u00e9com SudParis \/ Institut Polytechnique de Paris, FRANCE – Examinateur<\/p>\n\n\n\n\u00ab Machines \u00e0 \u00e9tats finis temporis\u00e9es avec d\u00e9lais de sortie : identification d’\u00e9tat et applications dans les syst\u00e8mes et r\u00e9seaux distribu\u00e9s \u00bb<\/h2>\n\n\n\n
pr\u00e9sent\u00e9 par Monsieur Evgenii VINARSKII<\/h2>\n\n\n\n
Abstract :<\/strong><\/p>\n\n\n\n