Finite automata models for CS problem with binary semaphore

  • Authors:

  • Boguslaw Schreyer;Wojciech Wawrzynski

  • Affiliations:

  • Nipissing University, Ontario, Canada;Politechnika Warszawska, Warszawa, Poland

  • Venue:
  • Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.