Branching Bisimilarity for Processes with Time-outs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910570488266752 |
|---|---|
| author | Reghem, Gaspard van Glabbeek, Rob |
| author_facet | Reghem, Gaspard van Glabbeek, Rob |
| contents | This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs. Multiple equivalent definitions are procured, along with a modal characterisation and a proof of its congruence property for a standard process algebra with recursion. The last section presents a complete axiomatisation for guarded processes without infinite sequences of unobservable actions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_10117 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Branching Bisimilarity for Processes with Time-outs Reghem, Gaspard van Glabbeek, Rob Logic in Computer Science F.1.2; F.3.2 This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs. Multiple equivalent definitions are procured, along with a modal characterisation and a proof of its congruence property for a standard process algebra with recursion. The last section presents a complete axiomatisation for guarded processes without infinite sequences of unobservable actions. |
| title | Branching Bisimilarity for Processes with Time-outs |
| topic | Logic in Computer Science F.1.2; F.3.2 |
| url | https://arxiv.org/abs/2408.10117 |