{"title":"通过定时自动控制器规范和验证B型控制器","authors":"O. Nasr, M. Rached, J.-P. Bodeveix, Mamoun Filali","doi":"10.3166/obj.14.4.43-72","DOIUrl":null,"url":null,"abstract":"This paper proposes a methodology for specifying and verifying real time schedulers using the B method. It is based on the refinement mechanism. We introduce successively the notions of scheduling and time. After having specified time management through stopwatches, a refinement introduces the notion of clocks. The obtained B machine can thus be considered as a timed automaton which refines the initial specification.","PeriodicalId":201701,"journal":{"name":"Obj. Logiciel Base données Réseaux","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Spécification et vérification d'un ordonnanceur en B via les automates temporisés\",\"authors\":\"O. Nasr, M. Rached, J.-P. Bodeveix, Mamoun Filali\",\"doi\":\"10.3166/obj.14.4.43-72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a methodology for specifying and verifying real time schedulers using the B method. It is based on the refinement mechanism. We introduce successively the notions of scheduling and time. After having specified time management through stopwatches, a refinement introduces the notion of clocks. The obtained B machine can thus be considered as a timed automaton which refines the initial specification.\",\"PeriodicalId\":201701,\"journal\":{\"name\":\"Obj. Logiciel Base données Réseaux\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Obj. Logiciel Base données Réseaux\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3166/obj.14.4.43-72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Obj. Logiciel Base données Réseaux","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3166/obj.14.4.43-72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spécification et vérification d'un ordonnanceur en B via les automates temporisés
This paper proposes a methodology for specifying and verifying real time schedulers using the B method. It is based on the refinement mechanism. We introduce successively the notions of scheduling and time. After having specified time management through stopwatches, a refinement introduces the notion of clocks. The obtained B machine can thus be considered as a timed automaton which refines the initial specification.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
