Conference item
The expressiveness of CSP with priority
- Abstract:
-
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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 238.2KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.entcs.2015.12.023
Authors
- Publisher:
- Elsevier
- Host title:
- Electronic Notes in Theoretical Computer Science
- Journal:
- Electronic Notes in Theoretical Computer Science More from this journal
- Volume:
- 319
- Pages:
- 387-401
- Publication date:
- 2015-12-01
- DOI:
- ISSN:
-
1571-0661
- Keywords:
- Pubs id:
-
pubs:593105
- UUID:
-
uuid:113d8609-1f23-4fa7-83c2-042babbd183e
- Local pid:
-
pubs:593105
- Source identifiers:
-
593105
- Deposit date:
-
2016-03-10
- ARK identifier:
Terms of use
- Copyright holder:
- Andrew Roscoe
- Copyright date:
- 2015
- Notes:
- © 2015 The Author. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
If you are the owner of this record, you can report an update to it here: Report update to this record