Boreale, Michele and De Nicola, Rocco Testing Equivalence for Mobile Processes. Information and Computation, 120 (2). pp. 279-303. ISSN 0890-5401 (1995)Full text not available from this repository.
The impact of applying the testing approach to a calculus of processes with dynamic communication topology is investigated. A proof system is introduced that consists of two groups of laws: those for strong observational equivalence and those needed to deal with invisible actions. Soundness and completeness of this proof system w.r.t. a testing preorder are shown. A fully abstract denotational model for the language is presented that takes advantage of reductions of processes to normal forms.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||14 Jun 2011 13:29|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)