Time unbalanced partial order
Peled, Doron and Qu, Hongyang (2006) Time unbalanced partial order. In: 5th International Workshop on Formal Approaches to Software Testing (FATES 2005), Edinburgh, SCOTLAND, JUL 11, 2005. Published in: FORMAL APPROACHES TO SOFTWARE TESTING, 3997 pp. 152-169.Full text not available from this repository.
Calculating the precondition of a particular partial-ordered set of events is often necessary in software testing, such as for generating test cases. Things become even more complicated when the execution time is added to the picture. If the execution time of two processes along a partial order does not match each other, the precondition of the partial order is false and then the partial order is identified as time unbalanced partial order. We present its formal definition and an algorithm to distinguish it. Then we suggest a method to fill the gap of the execution time of participating processes. This method can also be adopted to simplify the calculation of the minimal and maximal bounds of a time parameter.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||FORMAL APPROACHES TO SOFTWARE TESTING|
|Editor:||Grieskamp, W and Weise, C|
|Number of Pages:||18|
|Page Range:||pp. 152-169|
|Title of Event:||5th International Workshop on Formal Approaches to Software Testing (FATES 2005)|
|Location of Event:||Edinburgh, SCOTLAND|
|Date(s) of Event:||JUL 11, 2005|
Actions (login required)