Timing analysis of scenario-based specifications using linear programming

  • Authors:

  • Xuandong Li;Minxue Pan;Lei Bu;Linzhang Wang;Jianhua Zhao

  • Affiliations:

  • State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing 210093, People's Republic of China and Department of Computer Science and Technology, Nanjing University, Nanjing 210 ...;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing 210093, People's Republic of China and Department of Computer Science and Technology, Nanjing University, Nanjing 210 ...;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing 210093, People's Republic of China and Department of Computer Science and Technology, Nanjing University, Nanjing 210 ...;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing 210093, People's Republic of China and Department of Computer Science and Technology, Nanjing University, Nanjing 210 ...;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing 210093, People's Republic of China and Department of Computer Science and Technology, Nanjing University, Nanjing 210 ...

  • Venue:
  • Software Testing, Verification & Reliability
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scenario-based specifications (SBSs), such as UML interaction models, offer an intuitive and visual way of describing design requirements, and are playing an increasingly important role in the design of software systems. This paper presents an approach to timing analysis of SBSs expressed by UML interaction models. The approach considers more general and expressive timing constraints in UML sequence diagrams (SDs), and gives a solution to the reachability analysis, constraint conformance analysis and bounded delay analysis problems, which reduces these problems into linear programs. With the synchronous interpretation of the SD compositions, the timing analysis algorithms in the approach form a decision procedure for a class of SBSs where any loop in any path is time-independent of the other parts in the path. These algorithms are also a semi-decision procedure for general SBSs with both the synchronous and asynchronous composition semantics. The approach also supports bounded timing analysis of SBSs, which investigates all the paths in the bound limit one by one, and performs the timing analysis for each finite path by linear programming. A tool prototype has been developed to support this approach. Copyright © 2010 John Wiley & Sons, Ltd. (This paper presents a linear programming-based approach to timing analysis of scenario-based specifications (SBSs) expressed by UML interaction models. With more general and expressive timing constraints in UML sequence diagrams, the algorithms in the approach solve the problems of the reachability, constraint conformance and bounded delay analysis of SBSs. These algorithms form a decision procedure for the loop-unlimited SBSs where any loop in any path is time-independent of the other parts in the path, and a semi-decision procedure for general SBSs.)