Prolog program that determines whether a graph (represents processes and resources in operating systems) can reach a safe state (with no deadlock) or not.
-
Notifications
You must be signed in to change notification settings - Fork 0
Nada-Nasser/Safe-state-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Prolog program that determines whether a graph (represents processes and resources in operating systems) can reach a safe state (with no deadlock) or not.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published