Formal Framework for Cost Analysis Based on Process Algebra

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

[1]  Akinori Yonezawa,et al.  Software Security — Theories and Systems , 2003, Lecture Notes in Computer Science.

[2]  Shin-ya Nishizaki,et al.  A Cost Estimation Calculus for Analyzing the Resistance to Denial-of-Service Attack , 2003, ISSS.

[3]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[4]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[5]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[6]  Catherine A. Meadows,et al.  A formal framework and evaluation method for network denial of service , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[7]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[8]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.