GDL

Extended Process Algebra for Cost Analysis

ISSN : 1839-7662
Journal from gdlhub / 2017-08-14 11:52:34
Oleh : Hiroki Kiyoto and Shin-ya Nishizaki, International Journal of Computer Science & Information Technology
Dibuat : 2012-07-03, dengan 1 file

Keyword : Process algebra, the algebra of communicating systems, ACP, cost analysis, concurrent systems.
Subjek : Extended Process Algebra for Cost Analysis
Url : http://airccse.org/journal/ijfcst/papers/2212ijfcst01.pdf
Sumber pengambilan dokumen : Internet

Recently, the computational cost in execution of processes is considered to be one of the important


factors in concurrent systems and is beginning to interest to us. For example, the denial-of-service


attacks are related to it closely.Several formal systems have been proposed for reasoning about


concurrent systems. The Algebra of Communicating Processes (ACP) is proposed by J. A. Bergstra and J.


W. Klop, and an algebraic system for such reasoning. In such formal systems, the equivalence between


processes is the fundamental relation for reasoning, and several kinds of equivalence have been


investigated in the process algebras. These equivalence relations are based on behavior of processes. We


developed a formal system for reasoning about computational costs of concurrent systems in the previous


works, based on the Milner's pi-calculus. In this paper, we investigate another system based on a


subsystem of ACP, BPA(Basic Process Algebra). We first introduce cost value equality, which is based on


operational semantics of the process algebra and then give its formalized equality, called formal cost


equality. We study theoretical properties on the two equalities, such as soundness and completeness.


Moreover, we show some results on the cost formalization in other subsystems of ACP, such as PAP and


BPA+δ.

Deskripsi Alternatif :

Recently, the computational cost in execution of processes is considered to be one of the important


factors in concurrent systems and is beginning to interest to us. For example, the denial-of-service


attacks are related to it closely.Several formal systems have been proposed for reasoning about


concurrent systems. The Algebra of Communicating Processes (ACP) is proposed by J. A. Bergstra and J.


W. Klop, and an algebraic system for such reasoning. In such formal systems, the equivalence between


processes is the fundamental relation for reasoning, and several kinds of equivalence have been


investigated in the process algebras. These equivalence relations are based on behavior of processes. We


developed a formal system for reasoning about computational costs of concurrent systems in the previous


works, based on the Milner's pi-calculus. In this paper, we investigate another system based on a


subsystem of ACP, BPA(Basic Process Algebra). We first introduce cost value equality, which is based on


operational semantics of the process algebra and then give its formalized equality, called formal cost


equality. We study theoretical properties on the two equalities, such as soundness and completeness.


Moreover, we show some results on the cost formalization in other subsystems of ACP, such as PAP and


BPA+δ.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Computer Science & Information Technology
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com