Time Unbalanced Partial Order
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.
KeywordsExecution Time Partial Order Directed Acyclic Graph Shared Variable Program Variable
Unable to display preview. Download preview PDF.
- 1.Alur, R.: Timed Automata, NATO-ASI 1998 Summer School on Verification of Digital and Hybrid SystemsGoogle Scholar
- 2.Alur, R., Henzinger, T., Vardi, M.Y.: Parametric Real-time Reasoning. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 592–601 (1993)Google Scholar
- 3.Bensalem, S., Peled, D., Qu, H., Tripakis, S.: Automatic Generation of Path Conditions for Concurrent Timed Systems. In: 1st International Symposium on Leveraging Applications of Formal Methods (2004)Google Scholar