There are analogies between modeling the transportation systems with critical resources (CR) and a critical section (CS) problem in operating systems. This article is developing this analogy in the direction of using the finite automata. The article analyses Peterson's algorithm [4], [5] and Lamport's algorithm [2] using deterministic finite automata (DFA) as well as it takes into consideration the problem of modeling traffic with binary semaphore using nondeterministic finite automata (NFA). Introduction of finite automata makes traffic control modeling much clearer on programming side and brings hardware application closer to such control.

No abstract

A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast majority of texts. However, a finite automata approach offers simplicity and visualization of synchronization mechanisms.