Lists Home |
Date Index |
A finite state machine (FSM) or finite automaton is a model of
behavior composed of states, transitions and actions.
Refering to http://en.wikipedia.org/wiki/Finite_state_machine, I can
represent FSM as a XML for the door example as follows
<entryaction name="open door" />
<condition name="close door" tostate="closed" />
<entryaction name="close door" />
<condition name="open door" tostate="opened" />
Do you have something like this in mind?
On 4/12/06, Rick Jelliffe <email@example.com> wrote:
> Does anyone know of an (open source) Finite State Machine for XML, in any
> I made one years ago, but it is Bermuda Triangled now.
> Please note, I don't want an XML format for FSMs. However, an FSM for XML
> using an XML document type for FSMs would be great. I don't need a DTD for
> the XML format for FSMs, but an FSM for XML which includes DTDs would be
> 1.0 or 1.1
> Rick Jelliffe