Method for systematic modeling and evaluation of application flows
A system and method for modeling and evaluating resource requirements of services is disclosed. The system and method in one aspect enable describing an application session in a software model, for example, as a sequence of events in a sequence diagram, annotating the sequence diagram with information and using the sequence diagram and the information to create a mathematical model such as a Markov model that represents the application session. Once in Markov form the service can be analyzed. The system may include a user interface for allowing a user to enter annotations to the sequence diagram.
1. A system for modeling and evaluating impact on service components, comprising:
a processor operable to present a UML sequence diagram describing service components and flow of transactions between the service components, the processor further operable to enable entering information associated with the UML sequence diagram in a distinct and separate step from generating the UML sequence diagram, the processor further operable to derive a Markov model from the UML sequence diagram and entered information,
wherein the Markov model includes a plurality of states and state transition probabilities representing the flow of transactions between the service components; and
wherein the processor is further operable to automatically compute the state transition probabilities from the sequence diagram.
2. The system of claim 1 , further including a user interface operator to prompt for and receive the information associated with the sequence diagram.
3. The system of claim 1 , further including a data model associated with one or more elements in the sequence diagram.
4. The system claim 1 , wherein the processor is further operable to enable generating the sequence diagram.
5. The system of claim 1 , wherein the processor is further operable to reverse engineer the Markov model and create a new sequence diagram.
6. The system of claim 1 , wherein the processor is further operable to optimize the Markov model.
7. The system of claim 1 , wherein the processor is further operable to minimize the plurality of states.