Abstract In this paper, we employ the Communicating finite state machine (CFSM) model for networks to investigate fault identification using passive testing. First, we introduce the concept of passive testing. Then, we introduce the CFSM model and the observer model with necessary assumptions and justification. We introduce the fault model and the fault detection algorithm using passive testing...

The ability to reuse transformations across a range of related metamodels is highly desired for many model-driven approaches. For example, it would be useful to be able to reuse standard transformations like state-machine attening across models instantiating di erent metamodels of hierarchical state-machines, instead of having to reimplement the same fundamental algorithm just because of small ...

In this paper we present a fully symbolic TCTL model checking algorithm for incomplete timed systems. Our algorithm is able to prove that a TCTL property is violated or satisfied regardless of the implementation of unknown timed components in the system. For that purpose the algorithm computes overapproximations of sets of states fulfilling a TCTL property φ for at least one implementation of t...

Hierarchical State Machines (HSMs) are a natural model for representing the behavior of software systems. In this paper, we investigate a variety of model-checking problems for an extension of HSMs in which state machines are allowed to call each other recursively.

Echo state networks, liquid state machines, context reverberation networks– these all perform what has come to be known as “reservoir computing.” This approach to neural computation has been getting much attention lately. I wish to show that not only is it of scientific and technological interest, but of philosophical interest as well. It is not so much that reservoir computing raises new philo...

The general behavior of the ARQ protocols is modeled by a queueing network with priorities representing the erroneous and recovery processes. A mean value analysis algorithm is developed for the performance analysis of the model. The input parameters, the erroneous period and the recovery duration, for the model are gained from the extended finite state machine model description of the protocol...

In this paper, we employ the finite state machine (FSM) model for networks to investigate fault identification using passive testing. First, we introduce the concept of passive testing. Then, we introduce the FSM model with necessary assumptions and justification. We introduce the fault model and the fault detection algorithm using passive testing. Extending this result, we develop the theorems...

The trace assertion method is a formal state machine based method for specifying module interfaces ([3, 15, 25, 28, 32, 36]). A module interface speci cation treats the module as a black-box, identifying all module's access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible e ects. A formal model for the trace assertion method is pro...

One of the key points in Model-Driven Development is to provide a semantic anchoring that permits to design an application based on some common semantics but at the same time independently of the specific characteristics of the final platform. This paper proposes a common meta-model capable of holding both state machine and data flow semantics, two of the most used behaviour models. This is don...