Sciweavers

265 search results - page 14 / 53
» On varieties of meet automata
Sort
View
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 7 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
FMICS
2010
Springer
13 years 8 months ago
Model Checking the FlexRay Physical Layer Protocol
Abstract. The FlexRay standard, developed by a cooperation of leading companies in the automotive industry, is a robust communication protocol for distributed components in modern ...
Michael Gerke 0002, Rüdiger Ehlers, Bernd Fin...
HICSS
2002
IEEE
78views Biometrics» more  HICSS 2002»
14 years 13 days ago
What Is Effective GSS Facilitation? A Qualitative Inquiry into Participants' Perceptions
Facilitation in GSS meetings is considered among the most important critical success factors for effective GSS application. A considerable amount of research on GSS facilitation h...
Gert-Jan de Vreede, Jessica Boonstra, Fred Niederm...
ICLP
2005
Springer
14 years 1 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
IANDC
2007
133views more  IANDC 2007»
13 years 7 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich