Finite Automata synthesis from interactions

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, par...

Full description

Saved in:
Bibliographic Details
Published in2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE) pp. 12 - 22
Main Authors Mahe, Erwan, Bannour, Boutheina, Gaston, Christophe, Lapitre, Arnault, Le Gall, Pascale
Format Conference Proceeding
LanguageEnglish
Published ACM 14.04.2024
Subjects
Computational modeling
Graphical models
Instruments
Interaction language
Message Sequence Chart
Non-deterministic Finite Automaton
Operational Semantics
Runtime
Semantics
Sequence Diagram
Sequential analysis
Term Rewriting
Unified modeling language
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2575-5099