DocumentCode
1998476
Title
Extending statecharts with duration
Author
Leung, Karl R P H ; Chan, Daniel K C
Author_Institution
Dept. of Comput. Sci., Hong Kong Univ., Hong Kong
fYear
1996
fDate
21-23 Aug 1996
Firstpage
246
Lastpage
251
Abstract
Statecharts has been widely accepted as a successful graphical language for specifying reactive systems. However, some anomalies do exist when the durations of activities are subject to different interpretations such as with or without delay. A number of proposals have been put forward to address these anomalies but in a rather ad hoc fashion. The paper re-addresses these anomalies using a more uniform approach based on duration calculus. First, many anomalies are corrected by introducing new notations for specifying duration in statecharts. Second, the meanings of these notations are given in terms of duration calculus. Third, statecharts with duration can be subject to formal reasoning and hence verification. This framework delivers a more uniform extension to the graphical language as well as enables correctness with respect to duration to be studied formally using an established foundation
Keywords
delays; formal logic; formal verification; process algebra; specification languages; visual languages; correctness; delay; duration calculus; duration specification; formal reasoning; graphical language; reactive system specification; statecharts; verification; Broadcasting; Calculus; Computer science; Concurrent computing; Delay; Logic; Proposals; Real time systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1996. COMPSAC '96., Proceedings of 20th International
Conference_Location
Seoul
ISSN
0730-3157
Print_ISBN
0-8186-7579-9
Type
conf
DOI
10.1109/CMPSAC.1996.544173
Filename
544173
Link To Document