？？DIANXIANG X, XUDONG H, YI D. Compositional schedulability analysis of real-time systems using time Petri nets[J].IEEE Transactions on Software Engineering,2002,28(10):984-996.
[2]
？？JEFFREY T, STEVE Y. Timing constraint Petri nets and their application to schedulability analysis of real-time system specifications[J].IEEE Transactions on Software Engineering，1995, 21(1): 32-49.
[3]
？？TANG Da, LIU Danni. Method for dynamic verification of activity deadlines in timed workflow[J]. Computer Integrated Manufacturing Systems, 2004,10(9):1154-1159(in Chinese).[唐？？达, 刘丹妮. 一种工作流时间截止期限的动态验证方法[J]. 计算机集成制造系统,2004,10(9):1154-1159.]
[4]
？？BOTHA A, ELOFF J. Designing role hierarchies for access control in workflow systems[A].Computer Software and Applicationg Confereme[C].Chicago,IL,USA:IEEE Computer Society Press,2001.117-122.
[5]
？？JUN H, SUH H. The hierarchical frame of enterprise activity modeling(HF-EAM)[J].IEEE Transactions on Engineering Management, 2002, 49(4): 459-478.
[6]
？？TANG Da, YANG Yuansheng. Research on workflow participant mechanism and dynamic characteristic based on hierarchically refined Petri nets[J]. Journal of Computer Research and Development, 2004,41(9): 1545-1553(in Chinese).[唐？？达,杨元生.基于层次细化Petri网的工作流参与者机制遇动态特性研究[J].计算机研究与发展,2004,41(9):1545-1553.]
[7]
？？BENATALLAH B,PIOTR C W, HAMADI H, et al. HiWorD:a Petri net-based hierarchical workflow designer[A].Third International Conference on Application of Concurrency to System Design(ACSD′03)[C].Washington，D.C.,USA:IEEE Computer Society Press,2003.235-236.
？？WANG J, XU G, DENG Y. Reachability analysis of real time systems based on time Petri nets[J]. IEEE Transactions on System, Man and Cybernetics, 2000, 5(30): 725-736.
[10]
？？LI Jianqiang, FAN Yushun. Timing boundedness verification and analysis of workflow model[J]. Computer Integrated Manufacturing Systems, 2002,8(8):770-775(in Chinese).[李建强, 范玉顺.工作流模型时间有界性验证与分析研究[J]. 计算机集成制造系统,2002,8(8)：770-775.]
[11]
？？WERNER M, LOUCHKA P Z,RICHLING J. Non-reachability in priority duration Petri nets[A]. Proceedings of CS&P[C].Czarma,Poland:Warsaw University,2003.134-149.
