@inproceedings{55e103dd710e4f52867f84760d3bbedd,

title = "Time unbalanced partial order",

abstract = "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.",

author = "Doron Peled and Hongyang Qu",

year = "2006",

doi = "10.1007/11759744_11",

language = "אנגלית",

isbn = "3540344543",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "152--169",

booktitle = "Formal Approaches to Software Testing - 5th International Workshop, FATES 2005, Revised Selected Papers",

address = "גרמניה",

note = "5th International Workshop on Formal Approaches to Software Testing, FATES 2005 ; Conference date: 11-07-2005 Through 11-07-2005",

}