ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Sciences
Volume 51, Issue 2, July 1990, Pages 213-220
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (394 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0020-0255(90)90027-8    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1990 Published by Elsevier Science Inc.

High-level Petri-net model for a resource-sharing problem

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Ajoy K. Datta*

Sukumar Ghosh

Computer Science Department, University of Nevada, Las Vegas, Nevada 89154, USA

Department of Computer Science, University of Iowa, Iowa City, Iowa 52242, USA


Received 31 July 1987; 
revised 8 March 1988. 
Available online 20 May 2003.

Abstract

This paper deals with the modeling and analysis of a typical resource-sharing problem using a high-level Petri net. This model is at a level higher than any of the existing related class of Petri nets. With the introduction of structured places and generalized functional expressions as arc labels, our net is expected to be useful in modeling real-life problems in operating systems. Our analysis leads to a new solution of the classical banker's algorithm.

Article Outline

• References

* This research was supported in part by the Army Research Office under grant DAAL 03-87-G-0004.


Information Sciences
Volume 51, Issue 2, July 1990, Pages 213-220
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.