ISSN ONLINE(2320-9801) PRINT (2320-9798)

Yakışıklı erkek tatil için bir beldeye gidiyor burada kendisine türk Porno güzel bir seksi kadın ayarlıyor Onunla beraber otel odasına gidiyorlar Otel odasına rokettube giren kadın ilk önce erkekle sohbet ederek işi yavaş halletmeye çalışıyor sex hikayeleri Kocası fabrikatör olan sarışın Rus hatun şehirden biraz uzak olan bir türk porno kasabaya son derece lüks bir villa yaptırıp yerleşiyor Kocasını işe gönderip mobil porno istediği erkeği eve atan Rus hatun son olarak fotoğraf çekimi yapmak üzere türk porno evine gelen genç adamı bahçede azdırıyor Güzel hatun zengin bir iş adamının porno indir dostu olmayı kabul ediyor Adamın kendisine aldığı yazlık evde sikiş kalmaya başlayan hatun bir süre sonra kendi erkek arkadaşlarını bir bir çağırarak onlarla porno izle yapıyor Son olarak çağırdığı arkadaşını kapıda üzerinde beyaz gömleğin açık sikiş düğmelerinden fışkıran dik memeleri ile karşılayıp içeri girer girmez sikiş dudaklarına yapışarak sevişiyor Evin her köşesine yayılan inleme seslerinin eşliğinde yorgun düşerek orgazm oluyor

A Finite State Machine based Evaluation of Business Policy Enforcement in Long Term Composed Services

M. Thirumaran1, M. Jannani2
  1. Assistant Professor, Department of Computer Science and Engineering, Pondicherry Engineering College, Pondicherry, India
  2. PG Scholar, Department of Computer Science and Engineering, Pondicherry Engineering College, Pondicherry, India
Related article at Pubmed, Scholar Google

Visit for more related articles at International Journal of Innovative Research in Computer and Communication Engineering

Abstract

Web services are dynamically evolving entities which provide machine to machine interoperable interaction over a network. With the evolution of Service Oriented Enterprises (SOEs) and dynamic business environment, Web services have attained greater attraction. Change management in Web services in long term composition involves analyzing the change request and the service and incorporating the change cautiously without any issues. Though Web service change management is a wide area of research, there are no standard methodologies adopted for the evaluation of the change. In this paper, we focus on the evaluation of the changes made with the Finite State Machine as the methodology. Business Policy Enforcement in LCS is evaluated by policy mapping using Finite State Machine and is elucidated using Passport system as the case study.

Keywords

Service Oriented Architecture, Web Services, Change Management, Business Policy, Long term Composed Services

INTRODUCTION

Web services provide a new approach for accessing systems in a loosely coupled, platform independent and standardized manner. Though Web services are an evolutionary step beyond component based software architectures, they do not escape the necessity of the software lifecycle and one of its most challenging aspects: change management. On the contrary, Web services impose an even bigger change management challenge than does component based software. Currently there are no sound mechanisms and engineering principles for changing Web services and their related entities.
Change management is a structured approach for ensuring that changes are thoroughly and smoothly implemented, and that the lasting benefits of change are achieved. The focus is on the wider impacts of change, particularly on people and how they, as individuals and teams, move from the current situation to the new one. The change in question could range from a simple process change, to major changes in policy or strategy needed if the organization is to achieve its potential.
With the new paradigm of Service Oriented Computing, many enterprises attempt to utilize services as fundamental elements for developing applications as an additive layer on top of existing components and hence services in long term composition (LCS) have drawn greater importance as each service contributes towards the attainment of the business goal with its competency. So the paper focuses on evaluation of the changes made in long term composed services by detecting the policy violations if any from the unchanged service. Finite State Machine is the methodology used for the evaluation of the changes and hence the proposed change evaluation is based on structured and standard approach. This enables efficient evaluation of business policy enforcement through policy mapping.

RELATED WORK

The works related to the focus of the research are discussed in this section. An automatic change management framework that is based on the Petri net models has been proposed [1]. Mapping rules and propagation algorithms that handle the triggering changes and reactive changes respectively have been proposed. A change enactment strategy that actually implements the changes and a prototype system for the Ev-LCS has been proposed to demonstrate its effectiveness [2]. A change management framework has been proposed for service oriented enterprises which focuses on bottom up changes [3]. A cognitive approach to business process management elucidating from process logic to business logic has been proposed [4]. A dependency impact analysis model for evolution of Web services which analyses the impact of the dependencies has been proposed [5]. A framework supporting change impact analysis for Service Oriented Business Applications has been designed [6]. The concept of Context-adaptable Web service policies has been elucidated [7].

PROPOSED METHODOLOGY

Business policy enforcement is a measure of change which determines violation of policy in the identified change criteria. Here the main role of business policy enforcement is: policy mapping which is nothing but finding the appropriate policies which are associated with the rule or function in which the change has to be made and also with its dependent rules and functions; validation which refers checking whether there is any policy violation; and refinement which provides an environment for the analyst to modify the policy itself if necessary.

Case Study:

In a Passport system, consider a change request with the description that appointment scheduled more than thrice, and then no more appointment can be schedule. It will create new account for the applicant

R1 (Applicant Account Creation)

F1-To get the Applicant Account Creation first we have to get the personal details such as their name, age, current & permanent address, phone_ no, email_id, password, Applicant_id, Father’s name, Educational qualification, Type of passport, ECR status. P1 is the Applicant name who has applied for the passport. P2 is the age of the Applicant for the minor or major status. P3 is the current address and P4 is the permanent address of the Applicant to whom the information is sent. P5 is the phone_no of the Applicant to give any information. P6, P7 is the email_id,password of the Applicant for the valid Account creation. P8 is the Applicant_id whether it is valid or not. P9 is the Father’s of the Applicant to check whether information is valid or not. P10 is the type of passport whether it is normal, tatkaal, fresh or reissue. P11, P12 is the Educational Qualification and ECR status for the verification. P13 is the Marital status of the Applicant to check whether he/she is single or not. There is no dependency for F1.
F2 - To get the Applicant’s details and create a valid account for the Applicant. So F2 is dependent on F1.

R2 (Applicant Validity)

F3- After creating the Applicant’s account, it has to be checked whether the account is valid or not. So F3 is dependent on F2.

R3 (Eligibility)

F4- It is used to check whether he/she is the citizen of respecting country. P14 is the nationality of the Applicant to check, whether he/she is Indian or another citizen. P15 is the city of the Applicant. So F4 is dependent on F3.
F5- It is used to check age for the major or minor status. P16 is the birth place to check whether it is valid or not. P17 is the Parent’s citizenship; if the Applicant is minor he/she need to provide parent’s citizenship for the passport. So F5 is dependent on F3.
F6- It is used to check Identification is valid or not. P18 is the photo of the Applicant to whom passport required. P19 is the ID card of the Applicant to check he/she is the same person or not. So F6 is dependent on F3.
F7- It is used to validate other proofs. P20 is the PAN card, Driving License etc. So F7 is dependent on F3.

R4 (Passport Approval)

F8- After the documents verification, the appointment is schedule to the Applicant. On which date the applicant should be held is P21, on what time the applicant is held is P22, at which city and centre the applicant is held P23, P24 and the appointment_no is P25. So F8 is dependent on F3, F4, F5, F6, and F7.
F9- After the appointment, the applicant status is checked. Applicant_id is given to find out whether the Application is processing, rejected or approved is P26, P27, P28. So F9 is dependent on F8.
F10- Finally passport status is found out whether passport is pending or dispatched is P29, P30. So F10 is dependent on F9.

POLICIES:

PO1: If the Applicant is a minor provide Parent’s/Guardian details, PO2: If the type of passport is re-issue, details of old passport needs to be provided, PO3: If ECR status is “No”, then provide proof of education, PO4: If Appointment scheduled more than thrice, then no more appointment can be scheduled, PO5: Age, Identity, citizenship proof should be a document from the provided list.

FINITE STATE MACHINE REPRESENTATION

Here the state represents rule and transition is represented by using the symbol δi which includes the current state and the input which may also be an internal transition. Within the internal transition, the state is the function and similarly its transition includes current state and input which includes parameter set, policy set and dependency set. Each state has an exceptional state which decides whether that state can be rolled back or not.
In a business logic L encompassing set of rules R, functions F, parameters Pr, policy set P and dependency D , the change which is going to be made can be evaluated based on the Business Policy Enforcement factor which checks whether there is any policy violation with respect to the changes made.
Once the rules, functions and parameters in the change specifications are analyzed as complete, they are mapped with the existing logic set L. Then the corresponding rules, functions, parameters, dependency set and policy set are retrieved by which the change specification is checked whether it violates any policy. If so, the analyst is informed as the change cannot be made due to the violation of policy. Otherwise the change is successfully included in the existing logic set L.
The below algorithm provides a procedural approach for analyzing and evaluating the changes based on business policy enforcement

BEFORE IMPLEMENTING THE CHANGE REQUEST

STATE TRANSITION TABLE BEFORE IMPLEMENTING THE CHANGE

Here the δ 0 (q00, δ 01) represents the transition in which R2 represents the current state and δ 01 represents the input for δ0 and it is also the internal transition for δ0. Within the internal transition δ 01(q00, { P8}{(q00, (q1 }{ PO1}), q00 represents current state and input includes three sets in which first set is for parameter and second is for dependency and third one is for policy.

AFTER IMPLEMENTING THE CHANGE

After implementing the change, the policy PO4 is getting violated. So control reaches the exception state which again rolls back to the prior state (i.e. state without implementing the change request).

STATE TRANSITION TABLE AFTER IMPLEMENTING THE CHANGE

Here the parameter P31 is inserted in the parameter set of the function F8 but due to policy violation, the control reaches the exception state E and rolls back to the prior state without implementing the change. Hence after the roll back, the P31 is eliminated from the parameter set.
Thus the Business Policy Enforcement is evaluated through policy mapping. The percentage of policy violations detected is increased when FSM based evaluation is performed as shown in figure 3 (comparison has been done considering the same LCS and similar requests) which indicates that the evaluation process has been refined and has resulted in the increase in the detection of bugs.

CONCLUSION AND FUTURE WORK

The proposed methodology, Finite State Machine thus efficiently performs the evaluation of the changes made. Order of execution in LCS has been evaluated with the aid of the state transition table. The elucidation of the proposed approach using Passport system as the case study gives a clear idea of the change scenario and the evaluation of order of execution. The future enhancement is to include more factors for change evaluation which will aid in the assessment of the deviations in the functionality of an LCS after a change.
 

Tables at a glance

Table icon Table icon Table icon
Table 1 Table 2 Table 3
 

Figures at a glance

Figure 1 Figure 2 Figure 3
Figure 1 Figure 2 Figure 3
 

References