Abstract

An important issue in real-time computing is the development of a sufficiently abstract computational model. This model must enable one to specify, analyze, and implement distributed real-time systems. Therefore, there must also be a programming language based on the model. A description is given of such a programming language and its operational semantics. In the design of the language the applicative paradigm is extended to permit specification of parallelism, distribution, and time and temporal constraints. The language has constructs that use ideas from temporal logic and polymorphism to specify timing constraints. It uses the concept of events and a declarative event-handling style to represent communication and asynchrony. The formal model described is an operational semantics for the language and is based on dynamic algebras. The initial structure of the abstract machine for the language is described, and examples of transition rules are presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.