Editing Dining philosophers problem (section)

=== Limiting the number of diners in the table ===
A solution presented by [[William Stallings]]<ref>{{Cite book|last=Stallings|first=William|url=https://www.worldcat.org/oclc/1009868379|title=Operating systems : internals and design principles|date=2018|publisher=[[Pearson PLC|Pearson]]|isbn=978-1-292-21429-0|edition=9th|location=Harlow, Essex, England|pages=310|oclc=1009868379}}</ref> is to allow a maximum of ''n-1'' philosophers to sit down at any time. The last philosopher would have to wait (for example, using a semaphore) for someone to finish dining before he "sits down" and requests access to any fork. This negates circular wait, guaranteeing at least one philosopher may always acquire both forks, allowing the system to make progress.