This thesis presents a fully abstract order-theoretic denotational semantics for networks of asynchronous real-time processes. The time-sensitive nature of the component processes allows them to compute functions which are not Scott continuous, nor even monotonic, on the domain of timed message streams ordered by the usual prefix relation. Because of the discontinuous behavior of the components, the characterization of networks containing nonmonotonic processes as fixed points of continuous functionals (the standard approach of denotational semantics, applied to untimed networks of monotonic processes by Kahn in 1974) has been a much-sought but unattained goal. This thesis shows how it can be done in the case of timed networks. That is, the function computed by any real-time network, even those containing nonmonotonic processes, is proved to be identical to the least fixed point of a continuous network functional whose construction is original here.
展开▼
