Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!snorkelwacker!spdcc!ima!esegue!compilers-sender
From: carroll@udel.edu (Mark Carroll)
Newsgroups: comp.compilers
Subject: Re: Request pointers to compilers for `finite state machines'
Keywords: lex, DFA, question
Message-ID: <1990Aug06.185232.1799@esegue.segue.boston.ma.us>
Date: 6 Aug 90 18:52:32 GMT
References: <1990Aug05.225506.12815@esegue.segue.boston.ma.us>
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: Mark Carroll <carroll@udel.edu>
Organization: University of Delaware
Lines: 38
Approved: compilers@esegue.segue.boston.ma.us

In article <1990Aug05.225506.12815@esegue.segue.boston.ma.us> tfd!kent@uunet.UU.NET (Kent Hauser) writes:
>I'm looking for reference material (and of course examples) for compilers
>used to implement `finite state machines'.
...
>My specific applications are telephone signaling and data communications
>protocols. The engines for the two differ in that the former would be
>implemented by scanning at a fixed rate & changing state based on signaling
>state, etc.  The latter is more event driven (with timeout being one type of
>event).

I'd suggest looking at Estelle. Estelle is a language used to specify
network protocols. The protocol is specified in terms of communicating
modules, where the behavior of each module is described by a FSM. It
sounds like exactly what you're looking for. 

To find out more about Estelle, try:

@article{
title="An Introduction to Estelle:\
	A Specification Language for Distributed Systems",
author=" P. Dembinski and S. Budkowski",
journal="Computer Networks and ISDN Systems",
volume="14",
number="1",
month="January",
year="1987",
pages="3-23"
}
   

	<MC>
--
|Mark Craig Carroll: <MC>  
|Soon-to-be Grad Student at
|University of Delaware    
|carroll@dewey.udel.edu    
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus| world}!esegue.  Meta-mail to compilers-request@esegue.