实时系统的符号模型检查

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI:10.1109/LICS.1992.185551

T. Henzinger, X. Nicollin, J. Sifakis, S. Yovine

{"title":"实时系统的符号模型检查","authors":"T. Henzinger, X. Nicollin, J. Sifakis, S. Yovine","doi":"10.1109/LICS.1992.185551","DOIUrl":null,"url":null,"abstract":"Finite-state programs over real-numbered time in a guarded-command language with real-valued clocks are described. Model checking answers the question of which states of a real-time program satisfy a branching-time specification. An algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space, is given.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"480","resultStr":"{\"title\":\"Symbolic model checking for real-time systems\",\"authors\":\"T. Henzinger, X. Nicollin, J. Sifakis, S. Yovine\",\"doi\":\"10.1109/LICS.1992.185551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finite-state programs over real-numbered time in a guarded-command language with real-valued clocks are described. Model checking answers the question of which states of a real-time program satisfy a branching-time specification. An algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space, is given.<<ETX>>\",\"PeriodicalId\":6412,\"journal\":{\"name\":\"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"480\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1992.185551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1992.185551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 480

摘要

描述了一种带有实值时钟的保护命令语言在实数时间内的有限状态程序。模型检查回答了实时程序的哪些状态满足分支时间规范的问题。给出了一种算法，该算法将状态集符号地作为状态谓词上的函数的不动点来计算，而不构造状态空间

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Symbolic model checking for real-time systems

Finite-state programs over real-numbered time in a guarded-command language with real-valued clocks are described. Model checking answers the question of which states of a real-time program satisfy a branching-time specification. An algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space, is given.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量