| B. Thomsen. Plain CHOCS. Report DOC 89/4, Department of Computing, Imperial College, 1989. |
.... could be captured using the barbed bisimulation machinery. The answer has been the early version, a good point in favor of this one; in fact, the same results described here for CCS can be recovered for the corresponding early equivalences in the calculus. In Plain CHOCS and HO. Plain CHOCS ([12]) is a CCS based language where process passing is adopted; HO ( 4] is an enrichment of the calculus where besides names also processes and parametrized processes of arbitrarily high order can be transmitted. The adoption of the barbed bisimulations congruences seems to solve the non ....
Thomsen, B., Plain CHOCS, Report DOC 89/4, Department of Computing, Imperial College, London, 1989. 12
No context found.
B. Thomsen. Plain CHOCS. Report DOC 89/4, Department of Computing, Imperial College, 1989.
....to be executed of the sender. In a more recent version of the calculus, the Polyadic calculus presented in [Mil91] the outcomes of input and output actions are modelled by extending the syntax with the new constructions abstractions and concretions. The semantics for Thomsen s plain CHOCS in [Tho89] is based on the late approach although the author does not give it a specific name. In the literature the late semantic approach has been investigated in different ways, both in connection with the calculus and higher order calculi (see e.g. MPW91, Hen94, San93] and also with the main focus ....
B. Thomsen. Plain CHOCS. Report DOC 89/4, Department of Computing, Imperial College, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC