This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Using Predicate/Transition-Nets to Model and Analyze Distributed Database Systems
November 1980 (vol. 6 no. 6)
pp. 539-544
K. Voss, Institut fuer Informationssystemforschung, Gesellschaft fuer Mathematik und Datenverarbeitung
In this paper, a net model for decentralized control of user accesses to a distributed database is proposed. It is developed in detail for the restricted case of updating distributed copies of a single database. Predicate/transition-nets, a first-order extension of Petri nets, are shown to provide suitable means for concise representation of complex decentralized systems and for their rigorous formal analysis. It will be demonstrated in the present paper how these net models can be constructed and interpreted in a quite natural manner and how they can be analyzed by linear algebraic methods. By this, it will be shown that the modeled distributed database system is deadlock-free and guarantees a consistent database as well as a fair and effective service to the users.
Index Terms:
synchronization, Concurrency, consistency, database management, deadlock-free, decentralized control, distributed database, distributed processing, Petri nets, predicate/transition-nets
Citation:
K. Voss, "Using Predicate/Transition-Nets to Model and Analyze Distributed Database Systems," IEEE Transactions on Software Engineering, vol. 6, no. 6, pp. 539-544, Nov. 1980, doi:10.1109/TSE.1980.234502
Usage of this product signifies your acceptance of the Terms of Use.