De Nicola, Rocco and Hennessy, Matthew Testing Equivalence for Processes. In: Automata, Languages and Programming (ICALP 1983). Lecture Notes in Computer Science, 154 . Springer, pp. 548-560. ISBN 3-540-12317-2 (1983)
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/BFb0036936
Abstract
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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/BFb0036936 |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Rocco De Nicola |
| Date Deposited: | 06 Jun 2011 14:21 |
| Last Modified: | 11 Jul 2011 14:36 |
| URI: | http://eprints.imtlucca.it/id/eprint/395 |
Actions (login required)
 |
Edit Item |
