Process algebra with goal based bisimulation

Guang Zheng; Miao Jiang; Gao Chen; Qinglin Zha; Aiping Lu

doi:10.1109/ISECS.2010.28

Process algebra with goal based bisimulation

Guang Zheng
, Miao Jiang
, Gao Chen
, Qinglin Zha
, Aiping Lu^*

^*Corresponding author for this work

Office of the Dean of Chinese Medicine

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

1 Citation (Scopus)

Abstract

There is strong and weak bisimulation relationships in process algebras. These relationships compare processes on action-pairs. However, they can not specify another equivalent relationship based on the "goal" of processes. That is, processes starting from the same initial state, and end on the same state, are also a kind of equivalent relationship. In this paper, we propose goal based bisimulation under the framework of process algebra. This goal based bisimulation can classify processes on a more abstract level.

Original language	English
Title of host publication	2010 Third International Symposium on Electronic Commerce and Security
Editors	Fei Yu, Martha Russell, Neil Rubens, Jun Zhang
Place of Publication	California
Publisher	IEEE
Pages	89-95
Number of pages	7
ISBN (Print)	9781424482313
DOIs	https://doi.org/10.1109/ISECS.2010.28
Publication status	Published - 29 Jul 2010
Event	3rd International Symposium on Electronic Commerce and Security - Guangzhou, China Duration: 29 Jul 2010 → 31 Jul 2010 https://ieeexplore.ieee.org/xpl/conhome/5556871/proceeding (Conference proceeding)

Publication series

Name	International Symposium on Electronic Commerce and Security

Conference

Conference	3rd International Symposium on Electronic Commerce and Security
Abbreviated title	ISECS 2010
Country/Territory	China
City	Guangzhou
Period	29/07/10 → 31/07/10
Internet address	https://ieeexplore.ieee.org/xpl/conhome/5556871/proceeding (Conference proceeding)

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

User-Defined Keywords

Bisimulation
Complex system
Equivalent
Goal based
Process algebra

Access to Document

10.1109/ISECS.2010.28

Cite this

@inproceedings{77ada2e2321743d3aa63ef60c0001b0b,

title = "Process algebra with goal based bisimulation",

abstract = "There is strong and weak bisimulation relationships in process algebras. These relationships compare processes on action-pairs. However, they can not specify another equivalent relationship based on the {"}goal{"} of processes. That is, processes starting from the same initial state, and end on the same state, are also a kind of equivalent relationship. In this paper, we propose goal based bisimulation under the framework of process algebra. This goal based bisimulation can classify processes on a more abstract level.",

keywords = "Bisimulation, Complex system, Equivalent, Goal based, Process algebra",

author = "Guang Zheng and Miao Jiang and Gao Chen and Qinglin Zha and Aiping Lu",

note = "This work was partially supported by the Fundamental Research Funds for the Central Universities (No. lzujbky-2009-127), National Eleventh Five Year Support Project of China (2006BAI04A10), the Innovative Methodology Project supported by MOST of China(2008IM020900), National Science Foundation of China (No. 30902003, 30973975, and 90709007). Publisher Copyright: {\textcopyright} 2010 IEEE; 3rd International Symposium on Electronic Commerce and Security, ISECS 2010 ; Conference date: 29-07-2010 Through 31-07-2010",

year = "2010",

month = jul,

day = "29",

doi = "10.1109/ISECS.2010.28",

language = "English",

isbn = "9781424482313",

series = "International Symposium on Electronic Commerce and Security",

publisher = "IEEE",

pages = "89--95",

editor = "Fei Yu and Martha Russell and Neil Rubens and Jun Zhang",

booktitle = "2010 Third International Symposium on Electronic Commerce and Security",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/5556871/proceeding",

}

Zheng, G, Jiang, M, Chen, G, Zha, Q & Lu, A 2010, Process algebra with goal based bisimulation. in F Yu, M Russell, N Rubens & J Zhang (eds), 2010 Third International Symposium on Electronic Commerce and Security. International Symposium on Electronic Commerce and Security, IEEE, California, pp. 89-95, 3rd International Symposium on Electronic Commerce and Security, Guangzhou, China, 29/07/10. https://doi.org/10.1109/ISECS.2010.28

Process algebra with goal based bisimulation. / Zheng, Guang; Jiang, Miao; Chen, Gao et al.
2010 Third International Symposium on Electronic Commerce and Security. ed. / Fei Yu; Martha Russell; Neil Rubens; Jun Zhang. California: IEEE, 2010. p. 89-95 (International Symposium on Electronic Commerce and Security).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Process algebra with goal based bisimulation

AU - Zheng, Guang

AU - Jiang, Miao

AU - Chen, Gao

AU - Zha, Qinglin

AU - Lu, Aiping

N1 - This work was partially supported by the Fundamental Research Funds for the Central Universities (No. lzujbky-2009-127), National Eleventh Five Year Support Project of China (2006BAI04A10), the Innovative Methodology Project supported by MOST of China(2008IM020900), National Science Foundation of China (No. 30902003, 30973975, and 90709007). Publisher Copyright: © 2010 IEEE

PY - 2010/7/29

Y1 - 2010/7/29

N2 - There is strong and weak bisimulation relationships in process algebras. These relationships compare processes on action-pairs. However, they can not specify another equivalent relationship based on the "goal" of processes. That is, processes starting from the same initial state, and end on the same state, are also a kind of equivalent relationship. In this paper, we propose goal based bisimulation under the framework of process algebra. This goal based bisimulation can classify processes on a more abstract level.

AB - There is strong and weak bisimulation relationships in process algebras. These relationships compare processes on action-pairs. However, they can not specify another equivalent relationship based on the "goal" of processes. That is, processes starting from the same initial state, and end on the same state, are also a kind of equivalent relationship. In this paper, we propose goal based bisimulation under the framework of process algebra. This goal based bisimulation can classify processes on a more abstract level.

KW - Bisimulation

KW - Complex system

KW - Equivalent

KW - Goal based

KW - Process algebra

UR - https://www.scopus.com/pages/publications/77957592784

UR - https://ieeexplore.ieee.org/document/5557427

U2 - 10.1109/ISECS.2010.28

DO - 10.1109/ISECS.2010.28

M3 - Conference proceeding

AN - SCOPUS:77957592784

SN - 9781424482313

T3 - International Symposium on Electronic Commerce and Security

SP - 89

EP - 95

BT - 2010 Third International Symposium on Electronic Commerce and Security

A2 - Yu, Fei

A2 - Russell, Martha

A2 - Rubens, Neil

A2 - Zhang, Jun

PB - IEEE

CY - California

T2 - 3rd International Symposium on Electronic Commerce and Security

Y2 - 29 July 2010 through 31 July 2010

ER -

Process algebra with goal based bisimulation

Abstract

Publication series

Conference

UN SDGs

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this