Dartmout University developed a PQS system[8], which mainly used NFA(Nondeterministic
Finite Automaton) and invisible markov technology to realize the detection of a complex event from event stream.
A two-way nondeterministic
finite automaton (2NFA) is defined in the same way as [1.sub.[epsilon]]NFA, but now A can move in both directions along the input.
To check reliability they also proposed the model, namely
Finite Automaton model which is used for deriving Transaction properties of Composite web service and also to predict the behavior of overall composite services.
A one-way nondeterministic
finite automaton with [epsilon]-moves ([1.sub.[epsilon]]NFA, for short) is a quintuple A = (S, [summation], H, [s.sub.1], [S.sub.A]), where S is a finite set of states, [summation] an input alphabet, [s.sub.1] [member of] S an initial state, and [S.sub.A] [subset or equal to] S a set of accepting (final) states.
We can take care of this situation by designing a
finite automaton that recognizes odd length strings.
A
finite automaton is an abstract model with the original memory capacity of the machine.
A TA is a
finite automaton augmented with real-valued clocks.
5.3.4
Finite Automaton (Transducer) Network Construction
A PDA is a
finite automaton having a stack with infinite length, and a state transition is decided by the input symbol (event) and the stack symbol in the top of the stack.
The synthesis of the digital finite Mealy automaton is reduced to the following actions: 1) building the graph of the
finite automaton; 2) building a structured table of transitions for the defined graph; 3) creating the logic chart of the automaton [5].