DocumentCode
2764842
Title
A denotational semantics for RTPA
Author
Tan, Xinming ; Wang, Yingxu
Author_Institution
Dept. of Electr. & Comput. Eng., Calgary Univ., Alta.
fYear
2005
fDate
1-4 May 2005
Firstpage
2057
Lastpage
2060
Abstract
Real-time process algebra (RTPA) is designed to deal with a rich set of fundamental real-time processes such as timing, interrupt, concurrency, and event/time-driven. Some of the RTPA processes cannot be described adequately in conventional denotational semantics paradigms. This paper develops a new framework for modeling time and processes in order to represent RTPA in denotational semantics. Within this framework, time is modeled by elapse of process execution. The process environment encompasses states of all variables, represented as mathematical maps, which project variables to their corresponding values. Duration is introduced as a pair of time interval and the environment to represent the process environment change during a time interval. Temporal ordered durations and operations on them are used to denote process executions. With all these means, the semantics of RTPA processes of timing, interrupt, concurrency, event/time-driven, and traditional sequential processes can be formally expressed
Keywords
mathematics computing; process algebra; programming language semantics; denotational semantics; mathematical maps; real-time process algebra; time interval; Algebra; Concrete; Concurrent computing; Drives; Real time systems; Software engineering; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2005. Canadian Conference on
Conference_Location
Saskatoon, Sask.
ISSN
0840-7789
Print_ISBN
0-7803-8885-2
Type
conf
DOI
10.1109/CCECE.2005.1557391
Filename
1557391
Link To Document