[comp.theory] Converting FSMs to Queueing networks

gram@uctcs.uucp (Graham Wheeler) (10/25/90)

I am interested in the problem of converting extended finite state machines
into (open or closed) multiclass queueing networks (hopefully having
product form solutions). I want to implement a program to do this, so I
need an algorithmic method rather than ad hoc rules, although the latter
would also be helpful.

I haven't thought about this *too* much yet (I'm about to), so I'm not
sure whether it is intractable or fairly trivial. I guess it's somewhere
in-between. Does anyone have any good references/ideas/etc?

Please E-mail responses and I will summarise. Thanks.


Graham Wheeler		      |	"Don't bother me,
Data Network Architectures Lab|		I'm reading a `Crisis'!"
Dept. of Computer Science     | Internet: <gram.uctcs@f4.n494.z5.fidonet.org>
University of Cape Town       |     BANG: <...uunet!ddsw1!olsa99!uctcs!gram>