Results 1 
2 of
2
A Semantic Theory for ValuePassing Processes Late Approach  Part I: A Denotational Model and Its Complete Axiomatization
, 1995
"... A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete language is given, an instantiation of the general class. An equationally based proof system is defined and shown to be sound and complete with respect to the model.
Under consideration for publication in Formal Aspects of Computing Characterisations of Testing Preorders for a Finite Probabilistic πCalculus
"... Abstract. We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite πcalculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a fragment of MilnerParrowWalker modal logic for the πcal ..."
Abstract
 Add to MetaCart
Abstract. We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite πcalculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a fragment of MilnerParrowWalker modal logic for the πcalculus. We base our notions of simulations on similar concepts used in previous work for probabilistic CSP. However, unlike the case with CSP (or other nonvaluepassing calculi), there are several possible definitions of simulation for the probabilistic πcalculus, which arise from different ways of scoping the name quantification. We show that in order to capture the testing preorders, one needs to use the “earliest ” simulation relation (in analogy to the notion of early (bi)simulation in the nonprobabilistic case). The key ideas in both characterisations are the notion of a “characteristic formula ” of a probabilistic process, and the notion of a “characteristic test ” for a formula. As in an earlier work on testing equivalence for the πcalculus by Boreale and De Nicola, we extend the language of the πcalculus with a mismatch operator, without which the formulation of a characteristic test will not be possible.