Verifying scenarios with time Petri-nets

被引:6
作者
Lee, J [1 ]
Pan, JI
Kuo, JY
机构
[1] Natl Cent Univ, Dept Comp Sci & Informat Engn, Software Engn Lab, Chungli 32054, Taiwan
[2] Chien Kuo Inst Technol, Dept Informat Management, Chunghua, Taiwan
[3] Fu Jen Catholic Univ, Dept Comp Sci & Informat Engn, Taipei, Taiwan
关键词
scenarios; use case; time petri-nets; verification; requirements engineering;
D O I
10.1016/S0950-5849(01)00184-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, a substantial amount of research activities has been focused on a user-oriented perspective to the development of software systems. One of the key elements in this perspective is the notion of scenarios: a description of what people do and experience as they try to make usage of computer systems and applications. A variety of applications of scenarios has been proposed, for example, to elicit user requirements, or to validate requirements specifications. As scenarios are useful for the lifecycle of requirements engineering, it is important to enable verification of these scenarios, especially, to detect any wrong information and missing information that are hidden in scenarios. However, scenarios are usually stated in an informal way, which impedes the easiness for verification. The focus of this paper is on the use of time Petri-nets (TPNs) to serve as the verification mechanism for the acquired scenarios. Use cases are used to elicit the user needs and to derive the scenarios. Each of the use cases is described from a user's perspective and depicts a specific flow of events in the system. After specifying all possible scenarios, each of them can be transformed into its correspondent time Petri-nets model. Through the analysis of these TPNs models, wrong information and missing information in scenarios can be detected. The proposed approach is illustrated by means of a course registration problem domain. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:769 / 781
页数:13
相关论文
共 32 条
[21]  
LUBARS M, 1993, PROC INT CONF SOFTW, P255, DOI 10.1109/ICSE.1993.346038
[22]   RECOVERABILITY OF COMMUNICATION PROTOCOLS - IMPLICATIONS OF A THEORETICAL-STUDY [J].
MERLIN, PM ;
FARBER, DJ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1976, 24 (09) :1036-1043
[23]  
MULLER PA, 1997, INSTANT UML
[24]   PETRI NETS - PROPERTIES, ANALYSIS AND APPLICATIONS [J].
MURATA, T .
PROCEEDINGS OF THE IEEE, 1989, 77 (04) :541-580
[25]  
Peterson J., 1981, PETRI NET THEORY MOD
[26]   INQUIRY-BASED REQUIREMENTS ANALYSIS [J].
POTTS, C ;
TAKAHASHI, K ;
ANTON, AI .
IEEE SOFTWARE, 1994, 11 (02) :21-32
[27]  
QUATRAN T, 1998, VISUAL MODELING RATI
[28]  
RUMBAUGH J, 1994, J OBJECT-ORIENT PROG, V7, P8
[29]  
Schneider G. M., 1992, ACM Transactions on Software Engineering and Methodology, V1, P188, DOI 10.1145/128894.128897
[30]  
Some S., 1995, Proceedings 1995 Asia Pacific Software Engineering Conference, P48, DOI 10.1109/APSEC.1995.496953