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

F. Yang; H. Huang

doi:10.1007/s12204-014-1555-x

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

F. Yang, H. Huang

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

Samenvatting

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).

Originele taal-2	Engels
Pagina's (van-tot)	273-280
Tijdschrift	Journal of Shanghai Jiaotong University (Science)
Volume	20
Nummer van het tijdschrift	3
DOI's	https://doi.org/10.1007/s12204-014-1555-x
Status	Gepubliceerd - 1 jun. 2015

Toegang tot document

10.1007/s12204-014-1555-x

Citeer dit

@article{c6da3c5a1c3348aaae2516f5e28c9cd2,

title = "A polynomial time algorithm for checking regularity of totally normed process algebra",

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).",

author = "F. Yang and H. Huang",

year = "2015",

month = jun,

day = "1",

doi = "10.1007/s12204-014-1555-x",

language = "English",

volume = "20",

pages = "273--280",

journal = "Journal of Shanghai Jiaotong University (Science)",

issn = "1007-1172",

publisher = "Shanghai Jiaotong University",

number = "3",

}

TY - JOUR

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

AU - Yang, F.

AU - Huang, H.

PY - 2015/6/1

Y1 - 2015/6/1

N2 - 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).

AB - 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).

U2 - 10.1007/s12204-014-1555-x

DO - 10.1007/s12204-014-1555-x

M3 - Article

SN - 1007-1172

VL - 20

SP - 273

EP - 280

JO - Journal of Shanghai Jiaotong University (Science)

JF - Journal of Shanghai Jiaotong University (Science)

IS - 3

ER -

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

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit