DocumentCode
1297853
Title
Some design aspects of databases through Petri net modeling
Author
Hura, Gurdeep Singh ; Singh, Harpreet ; Nanda, N.K.
Author_Institution
Dept. of Comput. Sci., Wright State Univ., Dayton, OH, USA
Issue
4
fYear
1986
fDate
4/1/1986 12:00:00 AM
Firstpage
505
Lastpage
510
Abstract
The authors exploit the concepts of Petri nets for the modeling of databases through a meaningful interpretation of various database structures. This has been achieved using, specifically, the reachability and conflict concepts of Petri nets. The concept of conflict has been given a mathematical interpretation to suit its applications to database structures. Starting with a network structure, a new class of application for the reachability equation has been proposed. Based upon this, an algorithm has been postulated to access the data paths between any two specified nodes in the database model. The goal is to provide useful data for the design of databases.
Keywords
database management systems; directed graphs; Petri net modeling; conflict; data paths; database design; database structures; databases; reachability; Data models; Databases; Equations; Fires; Firing; Mathematical model; Petri nets; Database structures; Petri nets — conflict and reachability concepts; information retrieval decomposition; state space representation of Petri nets;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1986.6312897
Filename
6312897
Link To Document