DocumentCode
3658462
Title
A Reduction Method for Process and System Complexity with Conjunctive and Complement Choices in a Process Algebra
Author
Woorim Choi;Yeongbok Choe;Moonkun Lee
Author_Institution
Dept. of Comput. Sci. &
Volume
3
fYear
2015
fDate
7/1/2015 12:00:00 AM
Firstpage
381
Lastpage
386
Abstract
This paper introduces new notion of conjunctive and complement choices in process algebra, which reduces significant process and system complexity for distributed mobile real-time system during specification and analysis. The complement choice implies that two processes make cohesive choices for each other at its own choice operation. The conjunctive choice implies choice dependency among consecutive choice operations in a process. The conjunctive choice reduces process complexity exponentially by the degree of the choice dependencies. The complement choice also reduces system complexity exponentially by the degree of the choice dependencies. Consequently, the approach makes the specification and analysis of the systems much easier since the complexity is reduces significantly. This notion is implemented in a process algebra, called δ-calculus. The efficiency and effectiveness are demonstrated with an example in a tool for the algebra, called SAVE, which is developed on ADOxx platform.
Keywords
"Computers","Software","Conferences"
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference (COMPSAC), 2015 IEEE 39th Annual
Electronic_ISBN
0730-3157
Type
conf
DOI
10.1109/COMPSAC.2015.249
Filename
7273389
Link To Document