？？GORRIERI R,ROCCETTI M,STANCAMPIANO E.Theory of processes with durational actions[J].Theoretical Computer Science,1995,140(1): 73-94.
[4]
？？CORRADINI F,FERRARI G L,PISTORE M.On the semantics of durational actions[J].Theoretical Computer Science,2001,269(1-2): 47-82.
[5]
？？ACETO L,MURPHY D.Timing and causality in process algebra[J].ACTA Informatics,1996,33(4): 317-350.
[6]
？？COLIN F,JOHN Z.An expressive real-time CCS[A].Proceedings of the Twenty-Fifth Australasian Conference on Computer Science[C].Sydney,New South Wales,Australia:Australian Computer Society,1995.365-372.
[7]
？？JIM D,STEVE S.A brief history of timed CSP[J].Theoretical Computer Science,1995,138(2):243-271.
[8]
？？MILNER R.Communicating and mobile systems: the π-calculus[M].Cambridge，U.K.:Cambridge University Press,1999.
[9]
？？KUMAR P R.Scheduling semiconductor manufacturing plants[J].IEEE Control System Magazines,1994,14(6): 33-40.
[10]
？？DEGANO P,LODDO J V,PRIAMI C.Mobile processes with local clocks[A].Lecture Notes in Computer Science[C].Berlin，Germany:Springer,1996,1192: 296-319.
[11]
？？BERGER M.Towards abstractions for distributed systems[D].London,U.K.:Imperial College,2002.
[12]
？？BERGER M.Basic theory of reduction congruence for two timed asynchronous pi-calculi[A].Lecture Notes in Computer Science[C].Berlin,Germany:Springer,2004,3170.115-130.
[13]
？？FLAVIO C.Absolute versus relative time in process algebras[J].Information and Computation,2000,156: 122-172.
[14]
？？GROOTE J F.Transition system specification with negative premises[J].Theoretical Computer Science,1993,118(2):263-299.
