Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
A formal definition of priority in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
A classical mind
Probabilistic and prioritized models of timed CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Combining the Box Structure Development Method and CSP for Software Development
Electronic Notes in Theoretical Computer Science (ENTCS)
Understanding Concurrent Systems
Understanding Concurrent Systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
| Hi-index | 0.00 |
CSP treats internal τ actions as urgent, so that an infinite sequence of them is the misbehaviour known as divergence, and states with them available make no offer that we can rely on. While it has been possible to formulate a number of forms of abstraction in these models where the abstracted actions become τs, it has sometimes been necessary to be careful about the interpretation of τs and divergence. In this paper, inspired by an industrial problem, we demonstrate how this range of abstractions can be extended to encompass the offers made by processes during a run of "slow τs", namely abstractions of interactions with an external agent that does not usually respond urgently to an offer, but always eventually does respond. This extension requires the prioritise operator recently introduced into CSP and its refinement checker FDR. We demonstrate its use in the modelling used in Verum's ASD:Suite.