Sciweavers

31 search results - page 1 / 7
» Synthesizing Converters Between Finite State Protocols
Sort
View
ICCD
1991
IEEE
86views Hardware» more  ICCD 1991»
13 years 10 months ago
Synthesizing Converters Between Finite State Protocols
Janaki Akella, Kenneth L. McMillan
FSMNLP
2008
Springer
13 years 8 months ago
Applying Finite State Morphology to Conversion Between Roman and Perso-Arabic Writing Systems
This paper presents a method for converting back and forth between the Perso-Arabic and a Romanized writing systems for Persian. Given a word in one writing system, we use finite ...
Jalal Maleki, Maziar Yaesoubi, Lars Ahrenberg
DATE
2008
IEEE
111views Hardware» more  DATE 2008»
14 years 1 months ago
A Formal Approach To The Protocol Converter Problem
In the absence of a single module interface standard, integration of pre-designed modules in System-on-Chip design often requires the use of protocol converters. Existing approach...
Karin Avnit, Vijay D'Silva, Arcot Sowmya, S. Rames...
ACSD
2009
IEEE
106views Hardware» more  ACSD 2009»
13 years 9 months ago
Specification Enforcing Refinement for Convertibility Verification
Protocol conversion deals with the automatic synthesis of an additional component, often referred to as an adaptor or a converter, to bridge mismatches between interacting compone...
Partha S. Roop, Alain Girault, Roopak Sinha, Grego...
INFOCOM
2011
IEEE
12 years 10 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna