A polynomial time algorithm for checking regularity of totally normed process algebra

F. Yang, H. Huang

    Research output: Contribution to journalArticleAcademicpeer-review

    Abstract

    A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally normed process algebra (PA) processes is given. Its time complexity is O(n 3 +mn) O(n3+mn), where n is the number of transition rules and m is the maximal length of the rules. The algorithm works for totally normed basic process algebra (BPA) as well as basic parallel process (BPP).
    Original languageEnglish
    Pages (from-to)273-280
    JournalJournal of Shanghai Jiaotong University (Science)
    Volume20
    Issue number3
    DOIs
    Publication statusPublished - 1 Jun 2015

    Fingerprint

    Dive into the research topics of 'A polynomial time algorithm for checking regularity of totally normed process algebra'. Together they form a unique fingerprint.

    Cite this