Abstract
Finite automata with their graphs are an important tool in our Computer Science education. We have been using them for years in our Operating Systems I class, mainly in modeling the process synchronization and Critical Section (CS) problems. Now, we want to extend this method for dead- locks and process scheduling simulations. The intent of this paper is to develop an application of the Finite Automata (FA): DFA (Deterministic Finite Automata) and NFA (Nondeterministic Finite Automata) for software modeling in which the binary semaphores are used and a deadlock may occur. A classic case of two (or more) concurrent processes and two binary semaphores is investigated. Processes with a shared critical section (CS) are considered. We anticipate that this method will be used in the Computer Science education program.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
