2,940 research outputs found
Recommended from our members
Using formal methods to support testing
Formal methods and testing are two important approaches that assist in the development of high quality software. While traditionally these approaches have been seen as rivals, in recent
years a new consensus has developed in which they are seen as complementary. This article reviews the state of the art regarding ways in which the presence of a formal specification can be used to assist testing
Distinguishing sequences for partially specified FSMs
Distinguishing Sequences (DSs) are used inmany Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for PDSs is PSPACE-complete. We also report on the results of experiments with benchmarks and over 8 * 106 PSFSMs. Ā© 2014 Springer International Publishing
Automatic March tests generation for static and dynamic faults in SRAMs
New memory production modern technologies introduce new classes of faults usually referred to as dynamic memory faults. Although some hand-made March tests to deal with these new faults have been published, the problem of automatically generate March tests for dynamic faults has still to be addressed, in this paper we propose a new approach to automatically generate March tests with minimal length for both static and dynamic faults. The proposed approach resorts to a formal model to represent faulty behaviors in a memory and to simplify the generation of the corresponding tests
Checking sequence construction using adaptive and preset distinguishing sequences
Methods for testing from finite state machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these methods. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones. However, there has been no study on the actual effect of using adaptive distinguishing sequences on the length of checking sequences. This paper describes experiments that show that checking sequences constructed using adaptive distinguishing sequences are almost consistently shorter than those based on preset distinguishing sequences. This is investigated for three different checking sequence generation methods and the results obtained from an extensive experimental study are given
Discrete event approach to network fault management
Failure diagnosis in large and complex systems such as a communication network is a critical task. An important aspect of network management is fault management, i.e.,determining, locating, isolation, and correcting faults in the network. In the realm of discrete event systems Sampath et al proposed a failure diagnosis approach, and Jiang et al proposed an efficient algorithm for testing diagnosability. In this work, we adopt the framework of the communicating finite state machine (CFSM) of Miller et al for modeling networks and to investigate fault detection, fault identification and fault location using Sampath et al and Jiang et al methods. Our approach provides a systematic way of performing fault diagnosis aspects of network fault management
Time-Based Estimator for Control Reconfiguration of Discrete Event Systems (DES)
International audienceIn this paper, we propose a Time-based estimator method to reconfigure manufacturing systems in case of sensor faults detection. The main idea is to replace the information lost by a timed one. In non-faulty behavior, each sensor is defined through two events: activation and deactivation. Our contribution is to define an estimator model of each event based on different clocks to maintain the same desired behavior of the system in a faulty mode (reconfigured)
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
- ā¦