IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2024-03-29T05:15:04ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2011-06-13T09:08:57Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/385This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3852011-06-13T09:08:57ZCCS without tau'sThe main point of this paper is that one can develop an adequate version of CCS which does not use the special combinator tau for internal actions. Instead, the choice operator +, whose semantics is somewhat unclear, is replaced by two new choice operators oplus and [], representing internal and external nondeterminism respectively. The operational semantics of the resulting language is simpler and the definition of testing preorders is significantly cleaner. The essential features of the original calculus are kept; this is shown by defining a translation from CCS to the new language which preserves testing preorders.Rocco De Nicolar.denicola@imtlucca.itMatthew Hennessy2011-06-06T14:21:20Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/395This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3952011-06-06T14:21:20ZTesting Equivalence for ProcessesGiven 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.Rocco De Nicolar.denicola@imtlucca.itMatthew Hennessy2011-05-24T14:46:17Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/393This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3932011-05-24T14:46:17ZTesting Equivalences for ProcessesGiven 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.Matthew HennessyRocco De Nicolar.denicola@imtlucca.it