Xref: utzoo comp.protocols.misc:1062 comp.theory:1170
Path: utzoo!attcan!uunet!zephyr.ens.tek.com!tektronix!nosun!qiclab!m2xenix!quagga!ucthpx!uctcs.uucp!gram
From: gram@uctcs.uucp (Graham Wheeler)
Newsgroups: comp.protocols.misc,comp.theory
Subject: Converting FSMs to Queueing networks
Message-ID: <861@ucthpx.UUCP>
Date: 25 Oct 90 08:43:24 GMT
Sender: news@ucthpx.UUCP
Reply-To: gram@uctcs.uucp (Graham Wheeler)
Followup-To: comp.protocols.misc
Organization: Dept. of Computer Science, University of Cape Town
Lines: 17

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>