The expressiveness of CSP with priority
<p>The author previously defined CSP-like operational semantics whose main restrictions were the automatic promotion of most τ actions, no cloning of running processes, and no negative premises in operational semantic rules. He showed that every operator with such an operational semantics can...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Published: |
Elsevier
2015
|
| _version_ | 1826259713366425600 |
|---|---|
| author | Roscoe, A |
| author_facet | Roscoe, A |
| author_sort | Roscoe, A |
| collection | OXFORD |
| description | <p>The author previously defined CSP-like operational semantics whose main restrictions were the automatic promotion of most τ actions, no cloning of running processes, and no negative premises in operational semantic rules. He showed that every operator with such an operational semantics can be translated into CSP and therefore has a semantics in every model of CSP. In this paper we demonstrate that a similar result holds for CSP extended by the priority operator described in Chapter 20 of "Understanding concurrent systems" (Springer 2010), with the restriction on negative premises removed.</p> |
| first_indexed | 2024-03-06T18:54:08Z |
| format | Conference item |
| id | oxford-uuid:113d8609-1f23-4fa7-83c2-042babbd183e |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:54:08Z |
| publishDate | 2015 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:113d8609-1f23-4fa7-83c2-042babbd183e2022-03-26T10:01:11ZThe expressiveness of CSP with priorityConference itemhttp://purl.org/coar/resource_type/c_5794uuid:113d8609-1f23-4fa7-83c2-042babbd183eSymplectic Elements at OxfordElsevier2015Roscoe, A<p>The author previously defined CSP-like operational semantics whose main restrictions were the automatic promotion of most τ actions, no cloning of running processes, and no negative premises in operational semantic rules. He showed that every operator with such an operational semantics can be translated into CSP and therefore has a semantics in every model of CSP. In this paper we demonstrate that a similar result holds for CSP extended by the priority operator described in Chapter 20 of "Understanding concurrent systems" (Springer 2010), with the restriction on negative premises removed.</p> |
| spellingShingle | Roscoe, A The expressiveness of CSP with priority |
| title | The expressiveness of CSP with priority |
| title_full | The expressiveness of CSP with priority |
| title_fullStr | The expressiveness of CSP with priority |
| title_full_unstemmed | The expressiveness of CSP with priority |
| title_short | The expressiveness of CSP with priority |
| title_sort | expressiveness of csp with priority |
| work_keys_str_mv | AT roscoea theexpressivenessofcspwithpriority AT roscoea expressivenessofcspwithpriority |