Advanced SearchSearch Tips
A Process Algebra Construct Method for Reduction of States in Reachability Graph: Conjunctive and Complement Choices
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Journal of KIISE
  • Volume 43, Issue 5,  2016, pp.541-552
  • Publisher : Korean Institute of Information Scientists and Engineers
  • DOI : 10.5626/JOK.2016.43.5.541
 Title & Authors
A Process Algebra Construct Method for Reduction of States in Reachability Graph: Conjunctive and Complement Choices
Choe, Yeongbok; Lee, Moonkun;
This paper introduces the new notions of conjunctive and complement choices in process algebra, which reduce both process and system complexities significantly for distributed mobile real-time system during specification and analysis phases. The complement choice implies that two processes make cohesive choices for their synchronous partners at their own choice operations. 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 consecutive choice operations. The complement choice also reduces system complexity exponentially by the degree of the synchronous choice operations. Consequently, the reduction method makes the specification and analysis of the systems much easier since the complexity is reduced 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.
-Calculus;process algebra;conjunctive choice;complement choice;SAVE;ADOxx;
 Cited by
E. M. Clark, D. E. Long, and K. L. McMillan, Compositional Model Checking, Proc. of Fourth Annual Symposium on Logic in Computer Science, 1989.

W. J. Yeh and M. Young, Compositional Reachability Analysis using Process Algebra, Proc. of Conference on Testing, Analysis and Verification, pp. 49-59, Aug. 1992.

B. Josson and J. Parrow, Deciding Bisimulation Equivalences for a Class of Non-finite-state Programs, Technical Report SICS/R-89/8908, Swedish Institute of Computer Science, Aug. 1989.

S. Raju, An Automatic Verification Technique for Communicating Real-Time State Machines, Technical Report 93-04-08, Dept. of Computer Science and Engineering. Univ. of Washington, Apr. 1993.

I. Kang and I. Lee, State Minimization for Concurrent System Analysis Based on State Space Exploration, Proc. of Conference on Computer Assurance, pp. 123-134, 1994.

W. Choi, Y. Choe, M. Lee, A Reduction Method for Process and System Complexity with Conjunctive and Complement Choices in a Process Algebra, 39th Annual International Computer Software and Applications Conference Workshops, 2015.

Y. Choe, M. Lee, ${\delta}$-Calculus: Process Algebra to Model Secure Movements of Distributed Mobile Processes in Real-Time Business Applications, 23rd European Conference on Information Systems, 2015.

Fill, H. and Karagiannis, D., On the Conceptualisation of Modelling Methods Using the ADOxx Meta Modelling Platform, Enterprise Modelling and Information Systems Architectures 8(1). pp. 4-25, 2013.

R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, H. Wong-Toi, Minimization of Timed Transition Systems, In W. R. Cleaveland, editor, CONCUR 92: 3rd Intl Conf on Concurrency Theory, Lecture Notes in Computer Science vol. 630, Springer, pp. 340-354, 1992.

I. Kang, I. Lee and Y. Kim, An Efficient State Space Generation for the Analysis of Real-Time Systems, IEEE Transition on Software Engineering, Vol. 26, No. 5, pp. 453-477, 2000. crossref(new window)