{"title":"基于Petri网的复杂对象数据库程序建模应用","authors":"A. Oberweis, P. Sander, W. Stucky","doi":"10.1109/CMPSAC.1993.404227","DOIUrl":null,"url":null,"abstract":"In this paper a new type of high level Petri nets is introduced for modelling procedures in complex object database applications. Places in these so-called nested relation/transition nets (NR/T-nets) represent schemes of unnormalized (nested) relations. The marking of each place is a nested relation of the respective type. Each transition represents a specific type of operation on the relations in the adjacent places. These operations may not only operate on whole tuples of a given relation but also on sub-tuples of existing tuples. Arcs in a net are inscribed with so-called filter tables which allow to formulate conditions on the specified (sub-) tuples. Each NR/T-net defines a class of possible system procedures.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Petri net based modelling of procedures in complex object database applications\",\"authors\":\"A. Oberweis, P. Sander, W. Stucky\",\"doi\":\"10.1109/CMPSAC.1993.404227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new type of high level Petri nets is introduced for modelling procedures in complex object database applications. Places in these so-called nested relation/transition nets (NR/T-nets) represent schemes of unnormalized (nested) relations. The marking of each place is a nested relation of the respective type. Each transition represents a specific type of operation on the relations in the adjacent places. These operations may not only operate on whole tuples of a given relation but also on sub-tuples of existing tuples. Arcs in a net are inscribed with so-called filter tables which allow to formulate conditions on the specified (sub-) tuples. Each NR/T-net defines a class of possible system procedures.<<ETX>>\",\"PeriodicalId\":375808,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1993.404227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1993.404227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
摘要
本文介绍了一种用于复杂对象数据库建模的新型高级Petri网。这些所谓的嵌套关系/转换网(NR/ t -网)中的位置表示非规范化(嵌套)关系的方案。每个位置的标记是各自类型的嵌套关系。每个转换表示对相邻位置的关系的特定类型的操作。这些操作不仅可以操作给定关系的整个元组,还可以操作现有元组的子元组。网中的圆弧包含所谓的过滤表,允许在指定的(子)元组上制定条件。每个NR/T-net定义了一类可能的系统过程
Petri net based modelling of procedures in complex object database applications
In this paper a new type of high level Petri nets is introduced for modelling procedures in complex object database applications. Places in these so-called nested relation/transition nets (NR/T-nets) represent schemes of unnormalized (nested) relations. The marking of each place is a nested relation of the respective type. Each transition represents a specific type of operation on the relations in the adjacent places. These operations may not only operate on whole tuples of a given relation but also on sub-tuples of existing tuples. Arcs in a net are inscribed with so-called filter tables which allow to formulate conditions on the specified (sub-) tuples. Each NR/T-net defines a class of possible system procedures.<>