Name
Abstract | ||
|---|---|---|
Requirements-related scenarios capture typical examples of system behaviors through sequences of desired interactions between the software-to-be and its environment. Their concrete, narrative style of expression makes them very effective for eliciting software requirements and for validating behavior models. However, scenarios raise coverage problems as they only capture partial histories of interaction among system component instances. Moreover, they often leave the actual requirements implicit. Numerous efforts have therefore been made recently to synthesize requirements or behavior models inductively from scenarios. Two problems arise from those efforts. On the one hand, the scenarios must be complemented with additional input such as state assertions along episodes or flowcharts on such episodes. This makes such techniques difficult to use by the nonexpert end-users who provide the scenarios. On the other hand, the generated state machines may be hard to understand as their nodes generally convey no domain-specific properties. Their validation by analysts, complementary to model checking and animation by tools, may therefore be quite difficult. This paper describes tool-supported techniques that overcome those two problems. Our tool generates a labeled transition system (LTS) for each system component from simple forms of message sequence charts (MSC) taken as examples or counterexamples of desired behavior. No additional input is required. A global LTS for the entire system is synthesized first. This LTS covers all scenario examples and excludes all counterexamples. It is inductively generated through an interactive procedure that extends known learning techniques for grammar induction. The procedure is incremental on training examples. It interactively produces additional scenarios that the end-user has to classify as examples or counterexamples of desired behavior. The LTS synthesis procedure may thus also be used independently for requirements elicitation through scenario questions generated by the tool. The synthesized system LTS is then projected on local LTS for each system component. For model validation by analysts, the tool generates state invariants that decorate the nodes of the local LTS. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TSE.2005.138 | Software Engineering, IEEE Transactions |
Keywords | Field | DocType |
labeled transition systems,synthesis of behavior models,local lts,system component instance,lts synthesis procedure,invariant generation,synthesized system,system component,analysis tools.,additional input,incremental learning,index terms—scenario-based elicitation,generating annotated behavior models,global lts,model validation,entire system,system behavior,transition system,scenario generation,message sequence charts,end-user scenarios,indexing terms,learning artificial intelligence,petri nets,grammars,software requirements,flowcharting,formal verification,grammar induction,requirements elicitation,induction generator,message sequence chart,model checking,state machine,behavior modeling | Rule-based machine translation,Model checking,Grammar induction,Computer science,Requirements elicitation,Finite-state machine,Theoretical computer science,Flowchart,Software requirements,Formal verification | Journal |
Volume | Issue | ISSN |
31 | 12 | 0098-5589 |
Citations | PageRank | References |
63 | 2.32 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christophe Damas | 1 | 196 | 9.08 |
| Bernard Lambeau | 2 | 197 | 9.79 |
| Pierre Dupont | 3 | 380 | 29.30 |
| Axel van Lamsweerde | 4 | 4059 | 347.79 |