Sciweavers

396 search results - page 42 / 80
» Factor Automata of Automata and Applications
Sort
View
ENTCS
2006
231views more  ENTCS 2006»
13 years 7 months ago
SaveCCM: An Analysable Component Model for Real-Time Systems
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...
Jan Carlson, John Håkansson, Paul Pettersson
GLOBECOM
2010
IEEE
13 years 5 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
JLP
2010
85views more  JLP 2010»
13 years 2 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
PACT
2007
Springer
14 years 1 months ago
Orthogonal Organized Finite State Machine Application to Sensor Acquired Information
The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier wo...
Brian J. d'Auriol, John Kim, Sungyoung Lee, Young-...
DATE
2005
IEEE
97views Hardware» more  DATE 2005»
14 years 1 months ago
Efficient Solution of Language Equations Using Partitioned Representations
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...