{"title":"一种用于DEVS的正式验证方法","authors":"H. Dacharry, N. Giambiasi","doi":"10.1145/1357910.1357960","DOIUrl":null,"url":null,"abstract":"This paper describes several approaches to the formal verification of discrete event systems modeled with the DEVS formalism. We define the operational semantics of the DEVS formalism in terms of a timed transition system, then we characterize a subclass of DEVS models, through the definition of a formalism inspired by DEVS and timed automata, that allows the use of modelchecking tools. Finally, we discuss the application of this tools and present a simple example.","PeriodicalId":91410,"journal":{"name":"Summer Computer Simulation Conference : (SCSC 2014) : 2014 Summer Simulation Multi-Conference : Monterey, California, USA, 6-10 July 2014. Summer Computer Simulation Conference (2014 : Monterey, Calif.)","volume":"4 1","pages":"312-319"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A formal verification approach for DEVS\",\"authors\":\"H. Dacharry, N. Giambiasi\",\"doi\":\"10.1145/1357910.1357960\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes several approaches to the formal verification of discrete event systems modeled with the DEVS formalism. We define the operational semantics of the DEVS formalism in terms of a timed transition system, then we characterize a subclass of DEVS models, through the definition of a formalism inspired by DEVS and timed automata, that allows the use of modelchecking tools. Finally, we discuss the application of this tools and present a simple example.\",\"PeriodicalId\":91410,\"journal\":{\"name\":\"Summer Computer Simulation Conference : (SCSC 2014) : 2014 Summer Simulation Multi-Conference : Monterey, California, USA, 6-10 July 2014. Summer Computer Simulation Conference (2014 : Monterey, Calif.)\",\"volume\":\"4 1\",\"pages\":\"312-319\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Summer Computer Simulation Conference : (SCSC 2014) : 2014 Summer Simulation Multi-Conference : Monterey, California, USA, 6-10 July 2014. Summer Computer Simulation Conference (2014 : Monterey, Calif.)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1357910.1357960\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Summer Computer Simulation Conference : (SCSC 2014) : 2014 Summer Simulation Multi-Conference : Monterey, California, USA, 6-10 July 2014. Summer Computer Simulation Conference (2014 : Monterey, Calif.)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1357910.1357960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper describes several approaches to the formal verification of discrete event systems modeled with the DEVS formalism. We define the operational semantics of the DEVS formalism in terms of a timed transition system, then we characterize a subclass of DEVS models, through the definition of a formalism inspired by DEVS and timed automata, that allows the use of modelchecking tools. Finally, we discuss the application of this tools and present a simple example.