Mining Diamonds in labeled Transition Systems
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918004969701376 |
|---|---|
| author | van Spaendonck, P. H. M. Jilissen, K. H. J. |
| author_facet | van Spaendonck, P. H. M. Jilissen, K. H. J. |
| contents | Labeled transition systems can be a great way to visualize the complex behavior of parallel and communicating systems. However, if, during a particular timeframe, no synchronization or communication between processes occurs, then multiple parallel sequences of actions are able to interleave arbitrarily, and the resulting graph quickly becomes too complex for the human eye to understand easily. With that in mind, we propose an exact formalization of these arbitrary interleavings, and an algorithm to find all said interleavings in deterministic LTSs, to reduce the visual complexity of labeled transition systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_08689 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Mining Diamonds in labeled Transition Systems van Spaendonck, P. H. M. Jilissen, K. H. J. Formal Languages and Automata Theory Labeled transition systems can be a great way to visualize the complex behavior of parallel and communicating systems. However, if, during a particular timeframe, no synchronization or communication between processes occurs, then multiple parallel sequences of actions are able to interleave arbitrarily, and the resulting graph quickly becomes too complex for the human eye to understand easily. With that in mind, we propose an exact formalization of these arbitrary interleavings, and an algorithm to find all said interleavings in deterministic LTSs, to reduce the visual complexity of labeled transition systems. |
| title | Mining Diamonds in labeled Transition Systems |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2501.08689 |