Models and algorithms for network fault detection and identification: A review
This paper reviews probabilistic and finite-state-machine approaches to network modelling
for fault management. The fundamental structure of the fault management problem under the …
for fault management. The fundamental structure of the fault management problem under the …
Testing from a Z specification
RM Hierons - Software Testing, Verification and Reliability, 1997 - Wiley Online Library
This paper looks at the formal analysis of Z specifications in order to enhance the testing
process. An algorithm is given that rewrites the specification to a form from which both a …
process. An algorithm is given that rewrites the specification to a form from which both a …
[图书][B] Partitions: optimality and clustering
F Hwang, UG Rothblum - 2011 - books.google.com
The need of optimal partition arises from many real-world problems involving the distribution
of limited resources to many users. The “clustering” problem, which has recently received a …
of limited resources to many users. The “clustering” problem, which has recently received a …
Signature-based method for run-time fault detection in communication protocols1
G Noubir, K Vijayananda, HJ Nussbaumer - Computer Communications, 1998 - Elsevier
Run-time fault detection of communication protocols is essential because of faults that occur
in the form of coding defects, memory problems and external disturbances. We propose a …
in the form of coding defects, memory problems and external disturbances. We propose a …
Distributed fault detection in communication protocols using extended finite state machines
K Vijayananda - … of 1996 International Conference on Parallel …, 1996 - ieeexplore.ieee.org
Run-time fault detection in communication protocols is essential because of faults that occur
in the form of coding defects, memory problems, and external disturbances. Finite State …
in the form of coding defects, memory problems, and external disturbances. Finite State …
[图书][B] On the control of asynchronous machines with infinite cycles
N Venkatraman - 2004 - search.proquest.com
My study deals with the problem of eliminating the effects of infinite cycles on asynchronous
sequential machines by using state feedback controllers. In addition to eliminating the …
sequential machines by using state feedback controllers. In addition to eliminating the …
Fault tolerant multiple observers using error control codes
G Noubir, BY Choueiry… - Proceedings of 1996 …, 1996 - ieeexplore.ieee.org
We address the problem of detecting execution errors in communication protocols. A
communication protocol is modeled as or finite state machine (FSM) that can be used as an …
communication protocol is modeled as or finite state machine (FSM) that can be used as an …
On a class of optimal abstractions of finite-state machines
KN Oikonomou - Formal Methods in System Design, 1996 - Springer
An abstraction A of an fsm M consists in partitioning its states, inputs, and outputs into
groups, thus turning it into a non-deterministic fsm MA. For fixed sets of states, inputs, and …
groups, thus turning it into a non-deterministic fsm MA. For fixed sets of states, inputs, and …
Abstractions of Random Finite-State Machines
KN Oikonomou - Formal Methods in System Design, 2001 - Springer
Suppose that M is a large, complex finite-state system (fsm), and we want to construct a
smaller model of it. A way of doing so, independent of any special properties that M might …
smaller model of it. A way of doing so, independent of any special properties that M might …