Finite automata models for CS problem with binary semaphore
Bogusław Schreyer, Wojciech Wawrzyński · ACM SIGCSE Bulletin · 2006
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.