{"title":"实时模型检查:算法和复杂性","authors":"J. Worrell","doi":"10.1109/TIME.2008.30","DOIUrl":null,"url":null,"abstract":"In this talk we describe a new automata-theoretic approach to model checking real-time systems. We show how this approach yields both upper and lower complexity bounds for various decision problems involving timed automata and temporal logics. To put these developments in context we survey some classical results concerning automata, temporal logic and monadic predicate logic over the reals.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Real-Time Model Checking: Algorithms and Complexity\",\"authors\":\"J. Worrell\",\"doi\":\"10.1109/TIME.2008.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this talk we describe a new automata-theoretic approach to model checking real-time systems. We show how this approach yields both upper and lower complexity bounds for various decision problems involving timed automata and temporal logics. To put these developments in context we survey some classical results concerning automata, temporal logic and monadic predicate logic over the reals.\",\"PeriodicalId\":142549,\"journal\":{\"name\":\"2008 15th International Symposium on Temporal Representation and Reasoning\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 15th International Symposium on Temporal Representation and Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.2008.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 15th International Symposium on Temporal Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2008.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Real-Time Model Checking: Algorithms and Complexity
In this talk we describe a new automata-theoretic approach to model checking real-time systems. We show how this approach yields both upper and lower complexity bounds for various decision problems involving timed automata and temporal logics. To put these developments in context we survey some classical results concerning automata, temporal logic and monadic predicate logic over the reals.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
