IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2022-05-24T21:25:51ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2011-05-24T14:28:46Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/391This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3912011-05-24T14:28:46ZTwo Complete Axiom Systems for a Theory of Communicating Sequential ProcessesIn C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abstract version of Hoare's CSP is defined and a denotational semantics based on the possible failures of processes is given for it. This semantics induces a natural preorder on processes. We define formally this preorder and prove that it can be characterized as the smallest relation satisfying a particular set of axioms. The characterization sheds lights on problems arising from the way divergence and underspecification are handled. After small changes to the semantic domains we propose a new semantics which is closer to the operational intuitions and suggests a possible solution to the above problems. Finally we give an axiomatic characterization for the equivalence induced by the new semantics which leads to fully abstract models in the sense of Scott.Rocco De Nicolar.denicola@imtlucca.it2011-05-24T14:02:06Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/390This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3902011-05-24T14:02:06ZPartial ordering derivations for CCSIn this paper we extend CCS transitions, labelled by strings, to concurrent histories, i.e. to transitions labelled by partial orderings. The two notions are linked by a theorem which shows that the strings can be obtained by taking all interleavings compatible with the partial orderings.Pierpaolo DeganoRocco De Nicolar.denicola@imtlucca.itUgo Montanari2011-05-24T13:21:52Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/397This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3972011-05-24T13:21:52ZTesting Equivalences and Fully Abstract Models for Communicating ProcessesRocco De Nicolar.denicola@imtlucca.it