M. Dam. On the decidability of process equivalences for the -calculus. Theoretical Computer Science, 183(2):215--228, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Unique Fixpoint Induction for Mobile Processes - Lin (1995) (2 citations) (Correct)
....in guarded recursion xXF where each occurrence of X in F is within the scope of some pre x operator : In Section 4 concerning the completeness result it is further required that parallel composition j does not appear in recursion bodies. This sub language, as termed nite control in [Dam94], is the calculus analogue of the regular subset of pure CCS. Processes are terms without free occurrences of process variables and will be ranged over by P; Q; Bound names and bound variables induce the notion of equivalence as usual. In the sequel we will not distinguish between ....
M. Dam. On the decidability of process equivalences for the - calculus. Submitted, 1994. Swedish institute of Computer Science.
Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995) (2 citations) (Correct)
....and tools for process verification have been developed and actually used in several applications (e.g. protocol verification) In the case of the calculus, the issues related to program verification are under investigation. Decidability results for calculus bisimulations were recently presented [Dam95, MP95] and the development of automated verification tools is at a beginning stage. The MWB (Mobility Workbench) VM94] is, to our knowledge, the only automated tool for the calculus. The basic functionality of the MWB is checking open bisimulation equivalence [San93] which is stronger than both late ....
M. Dam. On the Decidability of Process Equivalences for the -calculus. In AMAST'95 volume 936 of , LNCS, Springer-Verlag, 1995.
History Dependent Automata - Montanari, Pistore (2001) (3 citations) (Correct)
No context found.
M. Dam. On the decidability of process equivalences for the -calculus. Theoretical Computer Science, 183(2):215--228, 1997.
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