Sciweavers

67 search results - page 10 / 14
» Reconfigurable models of finite state machines and their imp...
Sort
View
RULEML
2009
Springer
14 years 2 months ago
Correlating Business Events for Event-Triggered Rules
Abstract. Event processing rules may be prescribed in many different ways, including by finite state machines, graphical methods, ECA (event-conditionaction) rules or reactive rule...
Josef Schiefer, Hannes Obweger, Martin Suntinger
FATES
2004
Springer
13 years 11 months ago
Test Generation Based on Symbolic Specifications
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
APIN
2002
121views more  APIN 2002»
13 years 7 months ago
Applying Learning by Examples for Digital Design Automation
This paper describes a new learning by example mechanism and its application for digital circuit design automation. This mechanism uses finite state machines to represent the infer...
Ben Choi
INFOCOM
2006
IEEE
14 years 1 months ago
Network Protocol System Fingerprinting - A Formal Approach
— Network protocol system fingerprinting has been recognized as an important issue and a major threat to network security. Prevalent works rely largely on human experiences and i...
Guoqiang Shu, David Lee