Fair Termination for Resource-Aware Active Objects
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_ | 1866913999693545472 |
|---|---|
| author | Dagnino, Francesco Giannini, Paola Pun, Violet Ka I Torrella, Ulises |
| author_facet | Dagnino, Francesco Giannini, Paola Pun, Violet Ka I Torrella, Ulises |
| contents | Active object systems are a model of distributed computation that has been adopted for modelling distributed systems and business process workflows. This field of modelling is, in essence, concurrent and resource-aware, motivating the development of resource-aware formalisations on the active object model. The contributions of this work are the development of a core calculus for resource-aware active objects together with a type system ensuring that well-typed programs are fairly terminating, i.e., they can always eventually terminate. To achieve this, we combine techniques from graded semantics and type systems, which are quite well understood for sequential programs, with those for fair termination, which have been developed for synchronous~sessions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15333 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fair Termination for Resource-Aware Active Objects Dagnino, Francesco Giannini, Paola Pun, Violet Ka I Torrella, Ulises Programming Languages F.3.3 Active object systems are a model of distributed computation that has been adopted for modelling distributed systems and business process workflows. This field of modelling is, in essence, concurrent and resource-aware, motivating the development of resource-aware formalisations on the active object model. The contributions of this work are the development of a core calculus for resource-aware active objects together with a type system ensuring that well-typed programs are fairly terminating, i.e., they can always eventually terminate. To achieve this, we combine techniques from graded semantics and type systems, which are quite well understood for sequential programs, with those for fair termination, which have been developed for synchronous~sessions. |
| title | Fair Termination for Resource-Aware Active Objects |
| topic | Programming Languages F.3.3 |
| url | https://arxiv.org/abs/2508.15333 |