We develop a noninterleaving semantic theory of processes based on testing. We assume that all actions have a non-zero duration and the allowed tests take advantage of this assumption. The result is a semantic theory in which concurrency is differentiated from nondeterminism. We show that the semantic preorder based on these tests is preserved by so-caLled “stable” action refinement and may be characterised as the largest such preorder contained in the standard testing preorder.
CITATION STYLE
Hennessy, M. (1992). Concurrent testing of processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 630 LNCS, pp. 94–107). Springer Verlag. https://doi.org/10.1007/bfb0084785
Mendeley helps you to discover research relevant for your work.