Journal
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
Volume 319, Issue -, Pages 387-401Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.entcs.2015.12.023
Keywords
CSP; operational semantics; priority
Categories
Funding
- DARPA HACMS program
Ask authors/readers for more resources
The author previously [16,15] defined CSP-like operational semantics whose main restrictions were the automatic promotion of most tau 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 [15], with the restriction on negative premises removed.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available