DocumentCode :
2492898
Title :
The verification system by dense timing constraints and probabilities
Author :
Yamane, Satoshi
Author_Institution :
Fac. of Sci., Shimane Univ., Matue, Japan
fYear :
1996
fDate :
24-27 Jan 1996
Firstpage :
182
Lastpage :
189
Abstract :
Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective
Keywords :
computer aided software engineering; constraint handling; diagrams; formal specification; formal verification; probabilistic logic; probability; program verification; programming theory; software performance evaluation; software reliability; temporal logic; timing; TCTL; automatic verification method; dense timing constraints; formal specification; formal verification system; performance properties; probabilistic dense-time statechart; probabilistic dense-time temporal logic; real-time software; software reliability; timed computation tree logic; Automata; Automatic logic units; Cities and towns; Communication system software; Formal verification; Probabilistic logic; Random media; Real time systems; Safety; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering: Education and Practice, 1996. Proceedings. International Conference
Conference_Location :
Dunedin
Print_ISBN :
0-8186-7379-6
Type :
conf
DOI :
10.1109/SEEP.1996.533998
Filename :
533998
Link To Document :
بازگشت