Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,134
Stability of Deterministic Finite State Machines
"... Abstract — We approach deterministic finite state machines from a systems point of view and we consider three notions of input/output stability: finite gain input/output stability, external stability and incremental input/output stability, as they apply to this class of systems. We propose linear pr ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
Abstract — We approach deterministic finite state machines from a systems point of view and we consider three notions of input/output stability: finite gain input/output stability, external stability and incremental input/output stability, as they apply to this class of systems. We propose linear
Modular minimization of deterministic finite-state machines
- In 6th International Workshop on Formal Methods for Industrial Critical Systems
, 2001
"... Abstract This work presents a modular technique for minimizing a deterministic finite-state machine (FSM) while preserving its equivalence to the original system. Being modular, the minimization technique should consume less time and space. Preserving equivalence, the resulting minimized model can b ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
Abstract This work presents a modular technique for minimizing a deterministic finite-state machine (FSM) while preserving its equivalence to the original system. Being modular, the minimization technique should consume less time and space. Preserving equivalence, the resulting minimized model can
Prediction of Individual Sequences using Universal Deterministic Finite State Machines
"... Abstract — We consider the problem of universal prediction of individual binary sequences where the universal predictor is a deterministic finite state machine with a fixed number of states. We examine the case of self-information loss, where the predictions are probability assignments. The performa ..."
Abstract
- Add to MetaCart
Abstract — We consider the problem of universal prediction of individual binary sequences where the universal predictor is a deterministic finite state machine with a fixed number of states. We examine the case of self-information loss, where the predictions are probability assignments
Universal Prediction of Individual Sequences using Deterministic Finite State Machines
"... I would like to extend my gratitude to my advisor, Prof. Meir Feder, for his guidance, encouragement and support. Working with Meir not only made this thesis possible, but also enriched my graduate experience and made it both challenging and enjoyable. A special thanks goes to Roni Ilan, for coping ..."
Abstract
- Add to MetaCart
of individual sequences where the universal predictor is a deterministic finite state machine. Universal prediction of individual sequences refers to a case where a single predictor predicts a sequence, and is expected to predict as good as a reference predictor that has some previous knowledge regarding
Generating candidates when testing a deterministic implementation against a non–deterministic finite state machine
- The Computer Journal
"... This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine. This ca ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine
Bounded Sequence Testing from Non-deterministic Finite State Machines
"... Abstract. The widespread use of finite state machines (FSMs) in modeling of communication protocols has lead to much interest in testing from (deterministic and non-deterministic) FSMs. Most approaches for selecting a test suite from a non-deterministic FSM are based on state counting. Generally, t ..."
Abstract
- Add to MetaCart
Abstract. The widespread use of finite state machines (FSMs) in modeling of communication protocols has lead to much interest in testing from (deterministic and non-deterministic) FSMs. Most approaches for selecting a test suite from a non-deterministic FSM are based on state counting. Generally
Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting
"... The problem of generating a checking experiment from a non-deterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow ..."
Abstract
- Add to MetaCart
The problem of generating a checking experiment from a non-deterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow
Automatic verification of finite-state concurrent systems using temporal logic specifications
- ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract
-
Cited by 1388 (62 self)
- Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems. Experimental results show that state machines
The complexity of theorem-proving procedures
- IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract
-
Cited by 1050 (5 self)
- Add to MetaCart
alphabet Σ. This alphabet is large enough to include symbols for all sets described here. All Turing machines are deterministic recognition devices, unless the contrary is explicitly stated.
Results 1 - 10
of
5,134
