Abstract
AbstractIt is known as generally impossible to generate automatically the test cases for arbitrary LOTOS expression containing data parameters. A subclass of LOTOS, called P‐LOTOS, is defined. In P‐LOTOS, the data type is restricted to be integer and Boolean and the operation on the integer is restricted to be the addition/subtraction and comparison.This paper presents an algorithm for automatic generation of the test cases for this class of LOTOS descriptions. Algorithms also are presented solving the detection problems for the deadlocks, the unexecutable edges, and the nondeterministic branches. The proposed algorithm is applied to a simplified OSI session protocol, and the result is reported in this paper.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
