Business Logic Modeling Technique for N-tier E-Business Applications using Primitive Business Functions
Abstract
In today’s highly competitive market place business analyst need to be able to cope with the growing demand for new services and react at lightning speed to new customer requirements.[4]It has always been a question that whether the decided business logic is computable, reusable and maintainable with low cost and time.Business analyst can propose different business logic but deciding optimal business solution from the proposed logic is the key challenge where the business expert needs to concentrate on. This business logic modeling technique gives best business solution to the web service developer as a quality measure by analyzing the computational power of business functions involved in complex business logic. This paper preciously introduces new business functions derived from traditional primitive recursive function called Primitive Business Functions (PßF)[2] [3]. PßF are mathematical functions which has recursive power and ability to act as initial, composite and recursive in nature [1]. Primitive Business Function (PßF) breaks the complexity of complex business logic by partitioning it into number of business functions and represents them as initial, composite and μ-recursion in order to develop, reuse and maintain the web services associated with the business logic . We also provide an algorithm called Primitive Business Function Adapter Algorithm which can be easily build and adopted into N-tier service oriented E-business applications. We experimented the proposed algorithm as one of the tier in E-Banking web service development environment and observed the performance and reusable benefits of implementing decomposed business functions as web services rather than implementing the bounded business logic.
Keywords
Full Text:
PDFReferences
Neil D. Jones. An Introduction to Partial Evaluation. ACM Computing Surveys, 28(3):480–503, 1996.
Manuel, Lameiras, Campagnolo, The complexity of real recursive functions. D.M./I.S.A., Universidade T´ecnica de Lisboa, Tapada da Ajuda, 1349-017,
Lisboa, Portugal;C.L.C./D.M./I.S.T., Universidade T´ecnica de Lisboa,Av. Rovisco Pais, 1049-001, Lisboa, Portugal
Carl H. Smith. A Recursive Introduction to the Theory of Computation.Springer,1994.
Isabelle Rouvellou, Kevin Rasmus Dave Ehnebuske. Extending Business Objects with Business Rules., 2000 IEEE.
Todd L. Veldhuizen. C++ Templates as Partial Evaluation. In Proc. of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation(PEPM), Technical report BRICS NS-99-1, pages 13–18, 1999.
Todd L. Veldhuizen. Just when you thought your little language was safe:“Expression Templates” in Java. In Proc. of the 2nd Symp. Generative and Component-Based Software Engineering (GCSE), volume 2177,188–200. Springer, 2001.
Petia Wohed, Wil M.P. van der Aalst, Marlon Dumas, Arthur H.M. ter Hofstede,"Analysis of Web Services Composition Languages: The Case of BPEL4WS", In Proceedings 22nd International Conference on Conceptual Modelling (ER) 2813, pages pp. 200-215, 2004 Sren Riis ,Bootstrapping the Primitive Recursive Functions by 47 Colours, BRICSy June 1994 http://www.brics.dk/brics.dk (cdpub/BRICS)
Toshiyasu Arai ,Georg Moser,Tired Recursion and Strategies,Computational Logic, University of Innsbruck, georg.moser@uibk.ac.at
Gabelaia_, A. Kurucz_, F. Wolter† and M. Zakharyaschev, Non-primitive recursive decidability of products of modal logics with expanding domains.
Business Logic System ( www.businesslogic.co.uk)
Ying Zou and Maokeng Hung, Department of Electrical and Computer Engineering
Queen’s University. An Approach for Extracting Workflows from E-Commerce Applications. IEEE 2006.
DOI: http://dx.doi.org/10.36039/AA052009007
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.