Sciweavers

51 search results - page 4 / 11
» Subset Seed Automaton
Sort
View
CADE
2008
Springer
14 years 10 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
ENGL
2007
87views more  ENGL 2007»
13 years 9 months ago
Learning of Partial Languages
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
K. Sasikala, V. Rajkumar Dare, D. G. Thomas
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 1 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 1 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
ENTCS
2002
91views more  ENTCS 2002»
13 years 9 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya