{"title":"在Petri-net-like图中表示基于一阶逻辑的规范","authors":"K. Yue","doi":"10.1145/75199.75245","DOIUrl":null,"url":null,"abstract":"We describe a formalism that maps a first order logic-based specification into a graph representation (Influence Graph). The graph can be shown to be a representation scheme equivalent to ordinary Petri nets, with an emphasis on general causal implications instead of resource usage. By making the procedural aspects of a system explicit, the graph helps users in validating specifications of system behaviors. A program has been implemented to construct, simplify and analyze influence graphs.","PeriodicalId":435917,"journal":{"name":"International Workshop on Software Specification and Design","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Representing first order logic-based specifications in Petri-net-like graphs\",\"authors\":\"K. Yue\",\"doi\":\"10.1145/75199.75245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a formalism that maps a first order logic-based specification into a graph representation (Influence Graph). The graph can be shown to be a representation scheme equivalent to ordinary Petri nets, with an emphasis on general causal implications instead of resource usage. By making the procedural aspects of a system explicit, the graph helps users in validating specifications of system behaviors. A program has been implemented to construct, simplify and analyze influence graphs.\",\"PeriodicalId\":435917,\"journal\":{\"name\":\"International Workshop on Software Specification and Design\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Software Specification and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/75199.75245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Software Specification and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/75199.75245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Representing first order logic-based specifications in Petri-net-like graphs
We describe a formalism that maps a first order logic-based specification into a graph representation (Influence Graph). The graph can be shown to be a representation scheme equivalent to ordinary Petri nets, with an emphasis on general causal implications instead of resource usage. By making the procedural aspects of a system explicit, the graph helps users in validating specifications of system behaviors. A program has been implemented to construct, simplify and analyze influence graphs.