{"title":"Simulation and verification tool for hierarchical real-time systems","authors":"J. Sebestyénová","doi":"10.1109/ECBS.2004.1316707","DOIUrl":null,"url":null,"abstract":"The computerized tool for statecharts based modeling and simulation of reactive systems with timing constraints is described in the paper. GUI enables to draw and edit the statecharts, and to specify the required behavior of the system. Useful types of properties, such as state reachability, safety, and response, can be specified and verified. The model-checking algorithm for statecharts verification works without constructing the flat state-transition graph. If the required property does not hold in the system, the counter-example can be found without searching the whole state space.","PeriodicalId":137219,"journal":{"name":"Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECBS.2004.1316707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The computerized tool for statecharts based modeling and simulation of reactive systems with timing constraints is described in the paper. GUI enables to draw and edit the statecharts, and to specify the required behavior of the system. Useful types of properties, such as state reachability, safety, and response, can be specified and verified. The model-checking algorithm for statecharts verification works without constructing the flat state-transition graph. If the required property does not hold in the system, the counter-example can be found without searching the whole state space.