Re: RTS graph and "temporal formulas"

[Emanuel Berg <embe8573@student.uu.se>]

optikos@verizon.net writes:

> ... in the Wikipedia articles to which I directed you.

Yes, I will read it.

Only one more thing, for A, the "Moore-nomenclature response" is x
<= 10, but transitions from A are at x < 5 and x > 11. Does this
mean that the x < 5 transition is never made, because until x =
11, there is computation at A? Or does the A condition *hold* when
it is OK to make transitions? Or doesn't the A condition impact
flow, it just tells something about the system at state A?  Or
does computation "fork" so there are numerous processes all around
the graph?

/The Hairdresser

-- 
Emanuel Berg - programmer (hire me! CV below)
computer projects: http://user.it.uu.se/~embe8573
internet activity: http://home.student.uu.se/embe8573