Skip to main content
Log in

Recursive decomposition of software process

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Based on the theory of the structure of the computable mathematical function, the operator of the software process, algorithm structure and architecture are defined mathematically in this paper. With the expression of combinational functions, the mathematical definition of the decomposition of operator and its operation is discussed. Finally, the mathematical formula of the decomposition of operator-operator recursive decomposition formula is established. While focusing on solvable problems, the concept of the computing prototype tree and its formula proposed in this paper has generality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. CCITT. Specification and Description Language (SDL), Recommendation Z100[R/OL]. [2008-06-11]. http://www.itu.int/ITU-T/ studygroups/com10/languages/Z.100_1199. pdf .

  2. Broy M. Towards a Formal Foundation of the Specification and Description Language SDL[J].Formal Aspects of Computing, 1991, 3(1): 21–57.

    Article  MathSciNet  Google Scholar 

  3. Harel D. Statecharts: A Visual Formalism for Complex Systems[J]. Science of Computer Programming, 1987, 8(5): 231–274.

    Article  MATH  MathSciNet  Google Scholar 

  4. Van der Beek M. A Comparison of State Charts Variants[J]. Formal Techniques in Real Time and Fault-Tolerant Systems, 1994, 5(7): 128–148.

    Google Scholar 

  5. Booch G. Object Oriented Design with Applications[J]. Journal of Object-Oriented Programming, 1991, 3(5):74–76.

    Google Scholar 

  6. Jacobsen I. Object-Oriented Software Engineering[M]. New York: ACM Press, 1992.

    Google Scholar 

  7. Booch G, Rumbaugh J, Jacobson I. The Unified Modeling Language for Object-Oriented Development[M]. New York: Addison-Wesley Professional Press, 2005.

    Google Scholar 

  8. Hubmann H. Formal Foundation of Pragmatic Software Engineering Methods[J]. Innovationen bei Rechen-und Kommunikations-System, 1994, 6(3): 27–34.

    Google Scholar 

  9. Broy M. Taward a Mathematical Foundation of Software Engineering Methods[J]. IEEE Transactions on Software Engineering, 2001, 27(1): 42–57.

    Article  Google Scholar 

  10. Li Hui, Zhuang Yun. Mathematical Description of Software Architecture[J]. Application Research of Computers, 2005, 22(2): 492–493(Ch).

    MathSciNet  Google Scholar 

  11. Li Hui, Zhuang Yun. Mathematical Domain of Discourse for a Software Architecture[J]. Journal of Wuhan University (Engineering Edition), 2003, 36(4): 107–110(Ch).

    Google Scholar 

  12. Li Hui, Zhuang Yun. Level Model of Software Architecture[J]. Application Research of Computers, 2003, 20(4): 181–182(Ch).

    Google Scholar 

  13. Li Chuanxiang, Chen Shihong, Liu Haiqing. Programming Methodology[M]. Wuhan: Wuhan University Press, 2000(Ch).

    Google Scholar 

  14. Liu Haiqing, Li Hui. The Properties and Operators of a Software Architecture Operator Set [J]. Computer Engineering and Applications, 2003, 39(17): 87–88(Ch).

    Google Scholar 

  15. Liu Haiqing, Li Hui. A Software Architecture Operator and Its Analysis and Decomposition[J]. Journal of Wuhan University(Engineering Edition), 2002, 35(6): 77–80(Ch).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shihong Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, H., Chen, S. Recursive decomposition of software process. Wuhan Univ. J. Nat. Sci. 14, 143–147 (2009). https://doi.org/10.1007/s11859-009-0210-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-009-0210-0

Key words

CLC number

Navigation