The Expressiveness of CSP With Priority

The author previously A.W. Roscoe, On the expressiveness of CSP, https://www.cs.ox.ac.uk/files/1383/expressive.pdf, 2011; A.W. Roscoe, Understanding concurrent systems, Springer 2010 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 A.W. Roscoe, Understanding concurrent systems, Springer 2010, with the restriction on negative premises removed.

[1]  A. W. Roscoe,et al.  FDR3 - A Modern Refinement Checker for CSP , 2014, TACAS.

[2]  Bill Roscoe,et al.  On the expressive power of CSP extended by priority , 2014 .

[3]  Thomas Gibson-Robinson,et al.  Tyger: A Tool for Automatically Simulating CSP−Like Languages in CSP , 2010 .

[4]  A. W. Roscoe.  Understanding Concurrent Systems , 2010, Texts in Computer Science.

[5]  Jan Friso Groote,et al.  The Meaning of Negative Premises in Transition System Specifications , 1991, ICALP.

[6]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[7]  Gavin Lowe,et al.  Probabilistic and Prioritized Models of Timed CSP , 1995, Theor. Comput. Sci..

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Bill Roscoe,et al.  On the expressiveness of CSP , 2011 .

[10]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[11]  Colin J. Fidge,et al.  A formal definition of priority in CSP , 1993, TOPL.

[12]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

[13]  Wan Fokkink,et al.  Precongruence formats for decorated trace semantics , 2002, TOCL.

[14]  Rob J. van Glabbeek,et al.  On cool congruence formats for weak bisimulations , 2005, Theor. Comput. Sci..

[15]  Bill Roscoe,et al.  Slow abstraction through priority , 2013 .

[16]  Bill Roscoe,et al.  An Operational Semantics for CSP , 1986 .

[17]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[18]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .