Sciweavers

1246 search results - page 125 / 250
» Recursive Timed Automata
Sort
View
148
Voted
RTAS
2003
IEEE
15 years 10 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee
INFOCOM
2011
IEEE
14 years 8 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
ETFA
2006
IEEE
15 years 11 months ago
Optimizing Quality of Control in Networked Automation Systems using Probabilistic Models
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...
Jürgen Greifeneder, Georg Frey
137
Voted
GLVLSI
2006
IEEE
105views VLSI» more  GLVLSI 2006»
15 years 11 months ago
A practical approach for monitoring analog circuits
Formal methods have been advocated for the verification of digital design where correctness is proved mathematically. In contrast to digital designs, the verification of analog ...
Mohamed H. Zaki, Sofiène Tahar, Guy Bois
209
Voted
SPIN
2001
Springer
15 years 9 months ago
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
Michael Baldamus, Jochen Schröder-Babo