Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!caen!spool.mu.edu!olivea!tardis!tymix!uunet!mcsun!corton!imag!fernand
From: fernand@imag.imag.fr (Jean-Claude Fernandez)
Newsgroups: comp.lsi.cad
Subject: Re: State Machine Compilers
Message-ID: <22833@imag.imag.fr>
Date: 20 Jun 91 07:29:27 GMT
Article-I.D.: imag.22833
References: <21422@cadillac.CAD.MCC.COM> <10809@idunno.Princeton.EDU>
Organization: IMAG Institute, University of Grenoble, France
Lines: 25

In article <10809@idunno.Princeton.EDU> miyazaki@taichung (Takeshi Miyazaki) writes:
>
>Is there any ... program which can reduce finite state machine?
>(reduce the number of states and generate equivalent FSM)
>
>Takeshi Miyazaki
>miyazaki@ee.princeton.edu

I've done such a tool of minimization of finite transition systems. This tool was
done in a very different context :
@ARTICLE{fernandez90,
AUTHOR  = {J.C. Fernandez},
TITLE = {An Implementation of an Efficient Algorithm for Bisimulation
Equivalence},
JOURNAL = {Science of Computer Programming}, VOLUME = {13}, NUMBER = {2-3}, MONTH = {\may\ }, YEAR = {1990} }


But I'm ready to try some other examples, the field of VLSI seems interesting.

Interested reader would have to send me their exemple files and a syntax of the
description.

J.Cl. Fernandez
-- 
Jean-Claude Fernandez (fernand@imag.fr  fernand@imag.UUCP uunet.uu.net!imag!fernand)