M. Dam. On the decidability of process equivalences for the ß-calculus. Submitted for publication, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... ) is active in P if P 6 ( x)P , where denotes strong early bisimulation [28] Hereafter, we restrict our attention to finite state systems (that are syntactically characterized by avoiding the presence of recursive definitions within the scope of parallel compositions) and thus is decidable [13]. Furthermore, early bisimilarity is preserved if any input action of P instantiates its placeholder only with active names plus a new name for P . Therefore, our construction preserves qualitative properties of systems. Hereafter, we denote with A(x;P ) the predicate of x being active in P , and ....

M. Dam. On the decidability of process equivalences for ß-calculus. In Proceedings of AMAST'95, LNCS, pages 169--183. Springer-Verlag, 1995.

....transition sequences from terms are finite (up to alpha conversion) and hence the problems mentioned above are decidable. But there are decidable subcalculi which admit terms with infinite sets of transition sequences; a prime example is the so called finite control fragment investigated by Dam [Dam95] formed by using recursion rather than replication and requiring that parallel composition does not occur in recursive definitions. It may have been hoped that a similar decidable subcalculus can be found with replication rather than recursion, but this appears now not to be the case: even if ....

M. Dam. On the decidability of process equivalences for the ß- calculus. In V.S. Alagar and M. Nivat, editors, 4th International Conference on Algebraic Methodology and Software Technology, AMAST'95, volume 936 of Lecture Notes in Computer Science, pages 169--183. Springer-Verlag, 1995.

.... Research supported by CNR project Strumenti per la Verifica di Propriet a Critiche di Sistemi Concorrenti e Distribuiti and by CNET project Mod elisation de Syst emes Mobiles . In the calculus, the syntactic counterpart of CCS finite state processes are the finite control processes [3]. Due to the creation of new names, finite control processes can exhibit an infinite state behaviour. Three definitions of bisimulation, called late [7] early [7] and open [11] have been proposed for the calculus, and vary in the way name instantiations are handled. Here, we focus on open ....

....is less efficient than partitioning both in time and in space (especially in the case of weak bisimulations) However, on the fly can be superior on processes which exhibit a limited degree of non determinism; and it may return an answer even on non finite control processes, if not bisimilar. In [3] decidability of early and late bisimilarity for finite control processes is proved. In particular, it is shown that for every pair of finite control processes only a finite number of names is sufficient for checking bisimilarity; once the number of names if guessed, the state space of both agents ....

[Article contains additional citation context not shown here]

M. Dam. On the decidability of process equivalences for the ß-calculus. SICS Research Report RR:94-20, 1994.

....meta theoretical reasoning, temporal reasoning, or compositional techniques. In the former direction, symbolic techniques have been used in the context of model checking and bisimulation checking in the context of static process network fragments of value passing process calculi and the calculus [8, 9, 13]. However, these approaches by themselves have serious difficulties in dealing with dynamic process creation. One way of overcoming this problem is to use abstraction to derive finite state approximations of underlying infinite state models. For instance, Nielson and Nielson [19] derives a ....

M. Dam. On the decidability of process equivalences for the ß-calculus. Submitted for publication, 1994.

.... on the calculus of Milner, Parrow, and Walker [14] Other object based extensions of the calculus have been considered by Walker [21] and Jones [9] Algorithms exists for deciding properties such as deadlock freedom, equivalence, safety, or liveness properties for large classes of processes [3, 4], and rudimentary tools for automatically performing analyses are beginning to emerge [20] The class of processes that can be captured is, however, still too small. It includes processes that are, in essence, finite state up to naming of communication channels. This includes the 1 emitter 1 ....

M. Dam. On the decidability of process equivalences for the ß- calculus. Submitted for publication, 1994.

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