Fair testing
A Rensink, W Vogler - Information and Computation, 2007 - Elsevier
In this paper we present a solution to the long-standing problem of characterising the
coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process …
coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process …
Separation of synchronous and asynchronous communication via testing
One of the early results concerning the asynchronous π-calculus which significantly
contributed to its popularity is the capability of encoding the output prefix of the (choiceless) …
contributed to its popularity is the capability of encoding the output prefix of the (choiceless) …
Synchrony vs asynchrony in communication primitives
D Gorla - Electronic Notes in Theoretical Computer Science, 2007 - Elsevier
We study, from the expressiveness point of view, the impact of synchrony in the
communication primitives that arise when combining together some common and useful …
communication primitives that arise when combining together some common and useful …
Fair π
In this paper, we define fair computations in the π-calculus [Milner, R., Parrow, J. & Walker,
D., A Calculus of Mobile Processes, Part I and II, Information and Computation 100 (1992) 1 …
D., A Calculus of Mobile Processes, Part I and II, Information and Computation 100 (1992) 1 …
Feature refinement
S Reeves, D Streader - Fifth IEEE International Conference on …, 2007 - ieeexplore.ieee.org
Development by formal stepwise refinement offers a guarantee that an implementation
satisfies a specification. But refinement is frequently defined in such a restrictive way as to …
satisfies a specification. But refinement is frequently defined in such a restrictive way as to …