In this paper we consider we consider a variant of the process algebra ACP with rational time and integration. We shall indicate a subdomain of regular processes for which an Elimination Theorem holds: for each pair of processes p, q in this class there is a process z in this class such that p∥q and z have the same behaviour. Furthermore, we indicate by some simple examples that if the subdomain is restricted or enlarged, then the elimination result is lost. The subdomain has a strong link with the model of timed automata of Alur and Dill.
CITATION STYLE
Fokkink, W. J. (1993). An elimination theorem for regular behaviours with integration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 715 LNCS, pp. 432–446). Springer Verlag. https://doi.org/10.1007/3-540-57208-2_30
Mendeley helps you to discover research relevant for your work.