Date of this Version
Once strictly the province of assembly-language programmers, real-time computing has developed into an area of important theoretical interest. Real-time computing incorporates all of the theoretical problems encountered in concurrent processing and introduces the additional complexity of accounting for the temporal behavior of processes. In this paper we investigate two problems in the theory of real-time processes: defining realistic semantic models and developing proof systems for real-time processes. We present here a semantic domain for real-time processes that captures the temporal constraints of concurrent programs. A partial ordering based on process containment is defined and shown to be a complete partial order on the domain. The domain is used to define the denotational semantics of a CSP-like language that incorporates pure time delay. An axiomatization of process containment is presented and shown to be complete for finite terms in this language. The axiomatization is useful for proving properties of real-time processes and deriving their temporal behavior.
Richard Gerber, Insup Lee, and Amy E. Zwarico, "A Complete Axiomatization of Real-Time Processes", . November 1988.
Date Posted: 05 December 2007