101 search results - page 6 / 21 » General Algorithms for Testing the Ambiguity of Finite Autom... |
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
Online testing is a technique in which test derivation from a model program and test execution are combined into a single algorithm. We describe a practical online testing algorit...
FORTE
2004
13 years 8 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
DLT
2009
13 years 5 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...