Results 1  10
of
30,506
Deterministic Automaton with Unobservable Event
"... One of the key stages of the development of a fault tolerant Service oriented Architecture is the creation of Diagnosers, which monitors the system’s behaviour to identify the occurrence of failure. This paper presents a Model Driven Development (MDD) approach to the automated creation of the Diagno ..."
Abstract
 Add to MetaCart
One of the key stages of the development of a fault tolerant Service oriented Architecture is the creation of Diagnosers, which monitors the system’s behaviour to identify the occurrence of failure. This paper presents a Model Driven Development (MDD) approach to the automated creation of the Diagnosing Services and integrating them into the system. The outline of the method is as follows. BPEL models of the services are transformed to
BY MEANS OF A FINITE DETERMINISTIC AUTOMATON By
, 1977
"... The materials in this paper are elementary. A language L over an alphabet I is said to be regular if L=1ctl for some regular expression ct over I. It is familiar in [5, Chap. 1, g2], [2] and [4] that every language of this kind is represented by a certain finite deterministic automaton A. The format ..."
Abstract
 Add to MetaCart
The materials in this paper are elementary. A language L over an alphabet I is said to be regular if L=1ctl for some regular expression ct over I. It is familiar in [5, Chap. 1, g2], [2] and [4] that every language of this kind is represented by a certain finite deterministic automaton A
A Partial Deterministic Automaton for Approximate String Matching
 In Proc. of Fourth South American Workshop on String Processing (WSP'97
, 1997
"... . One of the simplest approaches to approximate string matching is to consider the associated nondeterministic finite automaton and make it deterministic. Besides automaton generation, the search time is O(n) in the worst case, where n is the text size. This solution is mentioned in the classical ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
. One of the simplest approaches to approximate string matching is to consider the associated nondeterministic finite automaton and make it deterministic. Besides automaton generation, the search time is O(n) in the worst case, where n is the text size. This solution is mentioned in the classical
An n log n algorithm for hyperminimizing a (minimized) deterministic automaton
 THEOR. COMPUT. SCI
, 2010
"... We improve a recent result [Badr: Hyperminimization in O(n²). Int. J. Found. Comput. Sci. 20, 2009] for hyperminimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic finite automaton (dfa) an almostequivalent dfa that is as small as possible suc ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
We improve a recent result [Badr: Hyperminimization in O(n²). Int. J. Found. Comput. Sci. 20, 2009] for hyperminimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic finite automaton (dfa) an almostequivalent dfa that is as small as possible
Distribution of the number of accessible states in a random deterministic automaton
 In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012
, 2012
"... We study the distribution of the number of accessible states in deterministic and complete automata with n states over a kletters alphabet. We show that as n tends to infinity and for a fixed alphabet size, the distribution converges in law toward a Gaussian centered around vkn and of standard devi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We study the distribution of the number of accessible states in deterministic and complete automata with n states over a kletters alphabet. We show that as n tends to infinity and for a fixed alphabet size, the distribution converges in law toward a Gaussian centered around vkn and of standard
An n log n Algorithm for HyperMinimizing States in a (Minimized) Deterministic Automaton
, 2009
"... ..."
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case. We conclude with some future work directions and open problems.
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints using finitely many realvalued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theory of timed automata, and their role in specification and verification of realtime systems.
WaitFree Synchronization
 ACM Transactions on Programming Languages and Systems
, 1993
"... A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lie ..."
Abstract

Cited by 873 (28 self)
 Add to MetaCart
A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lies at the heart of much recent work in concurrent algorithms, concurrent data structures, and multiprocessor architectures. In the first part of this paper, we introduce a simple and general technique, based on reduction to a consensus protocol, for proving statements of the form "there is no waitfree implementation of X by Y ." We derive a hierarchy of objects such that no object at one level has a waitfree implementation in terms of objects at lower levels. In particular, we show that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy: they cannot be used to construct waitfree implementations of many simple and familiar da...
A New Kind of Science
, 2002
"... “Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical amplit ..."
Abstract

Cited by 850 (0 self)
 Add to MetaCart
“Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical amplitudes you told me about, they’re so complicated and absurd, what makes you think those are right? Maybe they aren’t right. ’ Such remarks are obvious and are perfectly clear to anybody who is working on this problem. It does not do any good to point this out.” —Richard Feynman [1, p.161]
Results 1  10
of
30,506