Finite Automata In Software Modeling With Semaphores And Deadlock Potential
Bogusław Schreyer, Krzysztof Kosiński · 2014
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.