| A.S.A. Jeffrey and J. Rathke. Towards a theory of bisimilarity for local names. In Proc. LICS, pages 56--66. IEEE Computer Society Press, 1999. |
No context found.
A.S.A. Jeffrey and J. Rathke. Towards a theory of bisimilarity for local names. In Proc. LICS, pages 56--66. IEEE Computer Society Press, 1999.
....executing code rather than just functions or objects. They can also be seen as a restricted form of Cardelli and Gordon s [4] ambients, where the ambient tree is flat and names are used linearly. The authors made initial steps towards the current labelled transition semantics for local names in [15]. We proposed there a novel transition system which incorporated a notion of privacy as a means of studying locality in the sequential language n calculus of Pitts and Stark, 21] We adopt the same technique for modelling local names in the concurrent setting; however, the proof techniques for ....
....semantics for nCML and a coinductive presentation of barbed equivalence based on this. 3 Operational semantics and bisimulation equivalence We make our first steps towards characterizing barbed equivalence using a labelled transition system semantics. We adopt the approach we advocated in [15] by designing a semantics such that: ffl Bisimulation can be defined in the standard way, following Gordon [10] and Bernstein s [1] approach to bisimulation for higher order languages. This contrasts with the higher order bisimulation used by Thomsen [30] and Ferreira, Hennessy and Jeffrey [6] in ....
[Article contains additional citation context not shown here]
A.S.A. Jeffrey and J. Rathke. Towards a theory of bisimilarity for local names. In Proc. LICS, pages 56--66. IEEE Computer Society Press, 1999.
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