{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-term-based-approach-for-generating-finite","title":"A Term-based Approach for Generating Finite Automata from Interaction Diagrams","arxiv_id":"2306.02983","date":"2023-06-05","proceeding":null,"authors":["Erwan Mahe","Boutheina Bannour","Christophe Gaston","Arnault Lapitre","Pascale Le Gall"],"abstract":"Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach to generate NFA from an interaction language such as UML Sequence Diagrams or Message Sequence Charts. Via an operational semantics, we generate a NFA from a set of interactions reachable using the associated execution relation. In addition, by applying simplifications on reachable interactions to merge them, it is possible to obtain reduced NFA without relying on costly NFA reduction techniques. Experimental results regarding NFA generation and their application in trace analysis are also presented.","url_abs":"https://arxiv.org/abs/2306.02983v2","url_pdf":"https://arxiv.org/pdf/2306.02983v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-term-based-approach-for-generating-finite","repo_url":"https://github.com/erwanM974/hibou_label","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"a-term-based-approach-for-generating-finite","repo_url":"https://github.com/erwanm974/hibou_nfa_generation","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"a-term-based-approach-for-generating-finite","repo_url":"https://github.com/erwanm974/hibou_nfa_trace_analysis","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"a-term-based-approach-for-generating-finite","repo_url":"https://github.com/erwanm974/hibou_trs_simplify_empty","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}