Time Unbalanced Partial Order

  • Doron Peled
  • Hongyang Qu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3997)


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.


Execution Time Partial Order Directed Acyclic Graph Shared Variable Program Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R.: Timed Automata, NATO-ASI 1998 Summer School on Verification of Digital and Hybrid SystemsGoogle Scholar
  2. 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. 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
  4. 4.
    Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  5. 5.
    Gunter, E.L., Peled, D.: Path Exploration Tool. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, pp. 405–419. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 6.
    Hune, T., Romijn, J.M.T., Stoelinga, M.I.A., Vaandrager, F.W.: Linear parametric model checking of timed automata. Journal of Logic and Algebraic Programming 52-53, 183–220 (2002)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)CrossRefMATHGoogle Scholar
  8. 8.
    Peled, D., Qu, H.: Enforcing concurrent temporal behaviors. Electronic Notes in Theoretical Computer Science 113, 65–83 (2005)CrossRefMATHGoogle Scholar
  9. 9.
    Yovine, S.: Model checking timed automata. In: Rozenberg, G. (ed.) EEF School 1996. LNCS, vol. 1494, pp. 114–152. Springer, Heidelberg (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Doron Peled
    • 1
  • Hongyang Qu
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations