TY - GEN
T1 - CCS + time = an interleaving model for real time systems
AU - Yi, Wang
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.
PY - 1991
Y1 - 1991
N2 - This paper shows how to put time into Milner’s CCS to model real time systems. In particular, we will develop an expansion theorem for real time concurrency, which is an extension of the expansion theorem of CCS. The essential step made in this work is that a more general form of action prefix, μ@t.P is introduced, where t is a time variable. Intuitively, μ@t.P is an agent which may perform μ and become P[d/t] in doing so, where t is replaced by d, the time delay before μ is actually performed. The original form μ.P of action prefix of CCS is just a simple case of μ@t.P when t does not occur free in P — P does not depend on the time at which μ is performed.
AB - This paper shows how to put time into Milner’s CCS to model real time systems. In particular, we will develop an expansion theorem for real time concurrency, which is an extension of the expansion theorem of CCS. The essential step made in this work is that a more general form of action prefix, μ@t.P is introduced, where t is a time variable. Intuitively, μ@t.P is an agent which may perform μ and become P[d/t] in doing so, where t is replaced by d, the time delay before μ is actually performed. The original form μ.P of action prefix of CCS is just a simple case of μ@t.P when t does not occur free in P — P does not depend on the time at which μ is performed.
UR - https://www.scopus.com/pages/publications/84888697746
U2 - 10.1007/3-540-54233-7_136
DO - 10.1007/3-540-54233-7_136
M3 - 会议稿件
AN - SCOPUS:84888697746
SN - 9783540542339
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 217
EP - 228
BT - Automata, Languages and Programming - 18th International Colloquium, Proceedings
A2 - Albert, Javier Leach
A2 - Artalejo, Mario Rodriguez
A2 - Monien, Burkhard
PB - Springer Verlag
T2 - 18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991
Y2 - 8 July 1991 through 12 July 1991
ER -