This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some design aspects of databases through Petri net modeling
April 1986 (vol. 12 no. 4)
pp. 505-510
Gurdeep Singh Hura, Department of Computer Science, Wright State University, Dayton, OH 45431
Harpreet Singh, Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI 48202
N. K. Nanda, Department of Electronics and Communication Engineering, University of Roorkee, Roorkee 247672, India
The purpose of this paper is to exploit the concepts of Petri nets for the modeling of databases, through 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 application 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, with an aim to provide useful data for the design of databases.
Index Terms:
Databases,Firing,Petri nets,Mathematical model,Data models,Fires,Equations,state space representation of Petri nets,Database structures,information retrieval decomposition,Petri nets — conflict and reachability concepts
Citation:
Gurdeep Singh Hura, Harpreet Singh, N. K. Nanda, "Some design aspects of databases through Petri net modeling," IEEE Transactions on Software Engineering, vol. 12, no. 4, pp. 505-510, April 1986, doi:10.1109/TSE.1986.6312897
Usage of this product signifies your acceptance of the Terms of Use.