@inbook{10.2307/j.ctt7ztp96.8,
URL = {http://www.jstor.org/stable/j.ctt7ztp96.8},
abstract = {System behaviors are defined through finite-state generators and “acceptors” of behavior, known generally as “finite state machines” and “finite state automata”, respectively. In case all behavior is eventually terminating (bounded in time), each behavior is captured by astringof events. (Nonterminating (unbounded) behavior, captured by sequences of events, is dealt with analogously in Chapter 6). There are reasons, discussed in Section 6.2, for wanting, in both the bounded and infinite cases, two distinct types of structures for defining behavior: theprocessin the role of behavior generator, and theautomatonin the role of acceptor. The acceptor or automaton},
bookauthor = {Robert P. Kurshan},
booktitle = {Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach},
pages = {63--76},
publisher = {Princeton University Press},
title = {String Acceptors},
year = {1994}
}