Modeling Embedded Systems and SoC's

Chapter Two. Behavior and Concurrency

First we introduce finite state machines. We closely follow the first chapters of the book by Ullman (1979). In later chapters we assume that individual processes are modeled as finite state machines. Although other modeling notations could be used as well for this purpose, finite state machines constitute a fundamentally important technique that should be well mastered before dealing with process networks. Moreover, the chapter introduces the deep relationship between state machines and accepted or generated symbol sequences—useful for our purposes considering that processes can be viewed as accepting and generating event sequences continuously.

In the second part of the chapter we introduce Petri nets. Here ...