English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62796/95837 (66%)
Visitors : 3640404      Online Users : 399
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/68575


    Title: Equivalences, Congruences, and Complete Axiomatizations for probabilistic processes
    Authors: 周清江;Smolka
    Contributors: 淡江大學資訊管理學系
    Date: 1991-06-25
    Issue Date: 2011-10-23 13:17:20 (UTC+8)
    Abstract: We study several notions of process equivalence—viz. trace, failure, ready, and bisimulation equivalence—in the context of probabilistic labeled transition systems. We show that, unlike nondeterministic transition systems, “maximality” of traces and failures does not increase the distinguishing power of trace and failure equivalence, respectively. Thus, in the probabilistic case, trace and maximal trace equivalence coincide, and failure and ready equivalence coincide.

    We then propose a language PCCS for communicating probabilistic processes, and present its operational semantics. We show that in PCCS, trace equivalence and failure equivalence are not congruences, whereas Larsen-Skou probabilistic bisimulation is. Furthermore, we prove that trace congruence, the largest congruence contained in trace equivalence, lies between failure equivalence and bisimulation equivalence in terms of its distinguishing strength.

    Finally, we stress the similarity between classical process algebra and probabilistic process algebra by exhibiting sound and complete axiomatizations of bisimulation equivalence for finite and finite state probabilistic processes, which are natural extensions of the classical ones (R. Milner, “A complete inference system for a class of regular behaviours,” Journal of Computer and System Science, Vol. 28, 1984). Of particular interest is the rule for eliminating unguarded recursion, which characterizes the possibility of infinite syntactic substitution as a zero-probability event.
    Relation: Lecture Notes in Computer Science 458, pp.367-383
    DOI: 10.1007/BFb0039071
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File SizeFormat
    index.html0KbHTML68View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback