Hennessy, Matthew and De Nicola, Rocco Testing Equivalences for Processes. Theoretical Computer Science, 34. pp. 83-133. ISSN 0304-3975 (1984)Full text not available from this repository.
Given a set of processes and a set of tests on these processes we show how to define in a natural way three different equivalences on processes. These equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||24 May 2011 14:46|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)