James Riely and Matthew Hennessy. Distributed processes and location failures. Computer Science Technical Report 2/97, University of Sussex, Department of Computer Science, 1997. Available from http://www.cogs.susx.ac.uk/.  Home/Search   Document Not in Database   Summary   Related Articles

.... accompanied by the development of prototype languages such as Obliq [9] Pict [17] Oz [23] Facile [13] and the join calculus (DJoin) 11, 12] within the programming language research community, and the development of more abstract calculi, such as the p calculus [15] and its variations [2, 3, 18, 20, 21, 22], that directly address semantic and verification issues. This work should be considered a contribution to this last research effort. Research funded by HCM EXPRESS and EPSRC project GR K60701. Authors address: School of Cognitive and Computing Sciences, Univ. of Sussex, Falmer, Brighton, BN1 ....

....characterizations of the equivalence which do not involve universal quantification over observers. Such alternative characterizations, in the form of (labelled) bisimulation relations, have been given, for example, for the synchronous and asynchronous p calculi [20, 4] and for distributed CCS [18]. In the full paper, we present such an alternative characterization of barbed equivalence for Dp, for image finite processes. Space does not permit us to present the full definition here, rather we discuss some of the issues involved in developing the labelled transition system (LTS) which is the ....

[Article contains additional citation context not shown here]

James Riely and Matthew Hennessy. Distributed processes and location failures. Computer Science Technical Report 2/97, University of Sussex, Department of Computer Science, 1997. Available from http://www.cogs.susx.ac.uk/.

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