Finite Automata synthesis from interactions - CEA - Commissariat à l’énergie atomique et aux énergies alternatives Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Finite Automata synthesis from interactions

Résumé

Interactions are graphical models representing communication flows between actors. Well-known interaction languages include UML Sequence Diagrams or Message Sequence Charts. Even though interactions allow for concise and intuitive specifications, their use remains limited in formal verification, partly because the subsets of formalized languages often lack expressiveness. As many verification methods, such as model-checking or runtime verification, are routinely available for finite automata, we propose a new approach to generate finite automata from an expressive interaction language with operators such as the concurrent region. Our approach leverages an operational semantics to compute derivatives of an interaction and assimilate them to states of a finite automata. In addition, we use term rewriting to merge states on-the-fly so as to obtain small automata without relying on costly a-posteriori minimization techniques.
Fichier sous embargo
Fichier sous embargo
0 1 18
Année Mois Jours
Avant la publication
samedi 7 septembre 2024
Fichier sous embargo
samedi 7 septembre 2024
Connectez-vous pour demander l'accès au fichier

Dates et versions

cea-04604956 , version 1 (07-06-2024)

Identifiants

Citer

Erwan Mahe, Boutheina Bannour, Christophe Gaston, Arnault Lapitre, Pascale Le Gall. Finite Automata synthesis from interactions. FormaliSE '24 -the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering, Apr 2024, Lisbonne, Portugal. pp.12-22, ⟨10.1145/3644033.3644382⟩. ⟨cea-04604956⟩
41 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More