Abstract:

We propose to adopt semi-formal graphic language-message sequence charts to describe scenarios, regard events sequence of message transferring between use cases as an explicit scenario, and give its semantic. The main idea of this approach is to construct a prefix tree with positive scenario samples, which is a deterministic finite state automaton (DFA) accepting these positive scenario samples. A state combination algorithm that can get quotient automation is given.

Key words: message sequence chart, scenario-based specifications, component behavioral, quotient automaton