{"title":"Sigali工具箱环境","authors":"Loic Besnard, Hervé Marchand, Eric Rutten","doi":"10.1109/WODES.2006.382518","DOIUrl":null,"url":null,"abstract":"Sigali is a tool that offers functionalities for verification of reactive systems and discrete controller synthesis. It manipulates ILTS: Implicit Labeled Transition Systems, an equational and symbolic representation of automata. The techniques used consist in manipulating the system of equations modeling the system instead of the sets of solutions, thus avoiding the enumeration of the state space. Each set of states is uniquely characterized by a predicate and the operations on sets can be equivalently performed on the associated predicates. A wide variety of properties, such as invariance, reachability and attractivity can be checked or ensured. Many algorithms for computing state predicates are also available","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"The Sigali Tool Box Environment\",\"authors\":\"Loic Besnard, Hervé Marchand, Eric Rutten\",\"doi\":\"10.1109/WODES.2006.382518\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sigali is a tool that offers functionalities for verification of reactive systems and discrete controller synthesis. It manipulates ILTS: Implicit Labeled Transition Systems, an equational and symbolic representation of automata. The techniques used consist in manipulating the system of equations modeling the system instead of the sets of solutions, thus avoiding the enumeration of the state space. Each set of states is uniquely characterized by a predicate and the operations on sets can be equivalently performed on the associated predicates. A wide variety of properties, such as invariance, reachability and attractivity can be checked or ensured. Many algorithms for computing state predicates are also available\",\"PeriodicalId\":285315,\"journal\":{\"name\":\"2006 8th International Workshop on Discrete Event Systems\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 8th International Workshop on Discrete Event Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2006.382518\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 8th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2006.382518","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sigali is a tool that offers functionalities for verification of reactive systems and discrete controller synthesis. It manipulates ILTS: Implicit Labeled Transition Systems, an equational and symbolic representation of automata. The techniques used consist in manipulating the system of equations modeling the system instead of the sets of solutions, thus avoiding the enumeration of the state space. Each set of states is uniquely characterized by a predicate and the operations on sets can be equivalently performed on the associated predicates. A wide variety of properties, such as invariance, reachability and attractivity can be checked or ensured. Many algorithms for computing state predicates are also available