Time unbalanced partial order

Authors:
Doron Peled;Hongyang Qu
Affiliations:
Department of Computer Science, University of Warwick, Coventry, UK;Department of Computer Science, University of Warwick, Coventry, UK
Venue:
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Year:
2005

Citing 6
Cited 0

Parametric real-time reasoning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Path Exploration Tool

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Model Checking Timed Automata

Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Enforcing Concurrent Temporal Behaviors

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.