Web testing is an effective technique to ensure the quality of Web applications. With the development and implementation of web applications in variety of industries, testing web system becomes more and more important and difficult. This literature review paper addresses the use of practical usage model based on finite state machine. According to the FSM usage model, it details the process of g...

This paper presents and discusses a case study that applies techniques of simulation together with techniques of formal verification. A new approach in the plant modelling for formal verification of timed systems is presented. The modelling of the plant was performed by using the object-oriented language Modelica with the library for hierarchical state machines StateGraph and the simulation res...

The idea of using multiple speech recognizers and alternate language models in a spoken language task is a familiar one. The problems which arise are deciding which language model(s) and/or recognizer(s) to use, or when to change language models. We use the idea of local perplexity of a corpus to determine when to change to an alternate language model and compare this strategy to a number of ot...

The verification of systems with infinite state spaces has attained considerable attention in recent years. In particular, both global and local model checking techniques have been applied to the verification of such systems. However, new symbolic representations like predicate logics and finite automata have only been used in global model checking. In this paper, we therefore propose a techniq...

Within Model Driven Development (MDD), state machines are a common mechanism for modelling behaviour. The development of a formal semantics for state machines continues to be a very active and important area of research, because the development of interoperating MDD tools requires a precise, unambiguous, yet readable account of the meaning of the diagrams. Research on state machine semantics is...

Partitions {Lk}k=1 of A + into m pairwise disjoint languages L1, L2, . . . , Lm such that Lk = L + k for k = 1, 2, . . . , m are considered. It is proved that such a closed partition of A+ can separate the words u1, u2, . . . , um ∈ A+ (i.e. each Lk contains exactly one word of the sequence u1, u2, . . . , um) if and only if for each pair i, j of distinct elements in {1, 2, . . . , m}, the word...

This paper develops an entire communication support system for speech handicaps using lip reading. Our system is a high level system and consists of a face detector using Viola-jones method, lip detector based on active appearance model, utterance section detector, determined phrase recognizer using DP matching, camera controller, and message output. We implemented our system in the commercial ...

We report in this paper a novel hybrid approach for Urdu to Hindi transliteration that combines finite-state machine (FSM) based techniques with statistical word language model based approach. The output from the FSM is filtered with the word language model to produce the correct Hindi output. The main problem handled is the case of omission of diacritical marks from the input Urdu text. Our sy...