Process algebra, process scheduling, and mutual exclusion
| Authors | |
|---|---|
| Publication date | 01-03-2020 |
| Edition | v1 |
| Number of pages | 15 |
| Publisher | ArXiv |
| Organisations |
|
| Abstract | In the case of multi-threading as found in contemporary programming languages, parallel processes are interleaved according to what is known as a process-scheduling policy in the field of operating systems. In a previous paper, we extend ACP with this form of interleaving. In the current paper, we do so with the variant of ACP known as ACPϵ. The choice of ACPϵ stems from the need to cover more process-scheduling policies. We show that a process-scheduling policy supporting mutual exclusion of critical subprocesses is now covered. |
| Document type | Preprint |
| Note | Versions v2 and v3 (2020) also available on ArXiv. |
| Language | English |
| Published at | https://doi.org/10.48550/arXiv.2003.00473 |
| Downloads |
Process algebra, process scheduling, and mutual exclusion
(Submitted manuscript)
|
| Permalink to this page | |
