Communicating sequential processes
Communicating sequential processes
Specification-oriented semantics for communicating processes
Acta Informatica
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Weakest Congruence Results Concerning "Any-Lock"
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
A semantics for Behavior Trees using CSP with specification commands
Science of Computer Programming
Failure-divergence refinement of compensating communicating processes
FM'11 Proceedings of the 17th international conference on Formal methods
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
| Hi-index | 0.00 |
In an earlier paper [13], the author proved that there were three models of CSP that play a special role amongst the ones based on finite observations: the traces $({\cal T})$, stable failures $({\cal F})$ and stable revivals $({\cal R})$ models are successively more refined, but all further models refine ${\cal R}$. In the present paper we prove the corresponding result for the divergence-strict models: ones that treat any process that can diverge immediately as the least in the refinement order. We define what it is to be a divergence-strict model, both for general and finitely nondeterministic CSP, and find that in order to get our result we need to add a new but natural operator into the language.