Conclusion

* It seems feasible to transform from Hypergraph to time-line and I come up with one algorithm which can be used to assign time value of each node in hypergraph. However, the correctness has not been proved yet,so we are not sure whether it is going to work for all hypergraph or not. Some basic analysis of this algorithm is discussed and it is definitely necessary to improve the performance of this algorithm if it is correct. And the inconsistency of synchronization links in hypergraph is discussed. We say some of them can be detected by the algorithm proposed. But we donot know if all inconsistency can be detected or not.

* Because there is no 1-1 relation from time-line to hypergraph,we donot try to construct the transformation from time-line to hypergraph.

* One example tranformation from hypergraph to timeline is provided and implementation of the timeline result using Ulead and Flash MX is provied to visibly demostrate the temporal specification in hypergraph.