A Simple Trace Semantics for Asynchronous Sequence Diagrams
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913656139153408 |
|---|---|
| author | Faitelson, David Tyszberowicz, Shmuel |
| author_facet | Faitelson, David Tyszberowicz, Shmuel |
| contents | Sequence diagrams are a popular technique for describing interactions between software entities. However, because the OMG group's UML standard is not based on a rigorous mathematical structure, it is impossible to deduce a single interpretation for the notation's semantics, nor to understand precisely how its different fragments interact. While there are a lot of suggested semantics in the literature, they are too mathematically demanding for the majority of software engineers, and often incomplete, especially in dealing with the semantics of lifeline creation and deletion. In this work we describe a simple semantics based on the theory of regular languages, a mathematical theory that is a standard part of the curriculum in every computer science undergraduate degree and covers all the major compositional fragments, and the creation and deletion of lifelines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_10981 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Simple Trace Semantics for Asynchronous Sequence Diagrams Faitelson, David Tyszberowicz, Shmuel Software Engineering Formal Languages and Automata Theory Sequence diagrams are a popular technique for describing interactions between software entities. However, because the OMG group's UML standard is not based on a rigorous mathematical structure, it is impossible to deduce a single interpretation for the notation's semantics, nor to understand precisely how its different fragments interact. While there are a lot of suggested semantics in the literature, they are too mathematically demanding for the majority of software engineers, and often incomplete, especially in dealing with the semantics of lifeline creation and deletion. In this work we describe a simple semantics based on the theory of regular languages, a mathematical theory that is a standard part of the curriculum in every computer science undergraduate degree and covers all the major compositional fragments, and the creation and deletion of lifelines. |
| title | A Simple Trace Semantics for Asynchronous Sequence Diagrams |
| topic | Software Engineering Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2501.10981 |