Automation and Autonomous Systems

M. Thirumaran ¹, D. Kiran Kumar Reddy ², Karthiek Maralla ²

Affiliations
1 Pondicherry Engineering College, Pondicherry, IN
2 Tata Consultancy Service, Chennai, IN

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. 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 (PBF). PBF are mathematical functions which has recursive power and ability to act as initial, composite and recursive in nature. Primitive Business Function (PBF) 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

Primitive Business Function, Business Logic, E-Business, Recursive Function.

Full Text