{"title":"Petri网语言的最小表示","authors":"R. Sreenivas","doi":"10.1109/WODES.2002.1167694","DOIUrl":null,"url":null,"abstract":"Given a metric over the class of labeled Petri nets, we consider the existence of a procedure that takes as input a description of an arbitrary, labeled Petri net, and returns a description of a (possibly different) labeled Petri net with the smallest metric that generates the same language as the input. We refer to such procedures as minimization procedures. In this paper we investigate the existence of minimization procedures for a variety of metrics.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"209 1-2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On minimal representations of Petri net languages\",\"authors\":\"R. Sreenivas\",\"doi\":\"10.1109/WODES.2002.1167694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a metric over the class of labeled Petri nets, we consider the existence of a procedure that takes as input a description of an arbitrary, labeled Petri net, and returns a description of a (possibly different) labeled Petri net with the smallest metric that generates the same language as the input. We refer to such procedures as minimization procedures. In this paper we investigate the existence of minimization procedures for a variety of metrics.\",\"PeriodicalId\":435263,\"journal\":{\"name\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"volume\":\"209 1-2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2002.1167694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2002.1167694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Given a metric over the class of labeled Petri nets, we consider the existence of a procedure that takes as input a description of an arbitrary, labeled Petri net, and returns a description of a (possibly different) labeled Petri net with the smallest metric that generates the same language as the input. We refer to such procedures as minimization procedures. In this paper we investigate the existence of minimization procedures for a variety of metrics.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
