Sciweavers

1916 search results - page 135 / 384
» Reconfiguring a state machine
Sort
View
CONCUR
2000
Springer
14 years 11 days ago
Formal Models for Communication-Based Design
Concurrency is an essential element of abstract models for embedded systems. Correctness and e ciency of the design depend critically on the way concurrency is formalized and imple...
Alberto L. Sangiovanni-Vincentelli, Marco Sgroi, L...
ICML
2008
IEEE
14 years 8 months ago
On-line discovery of temporal-difference networks
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...
Takaki Makino, Toshihisa Takagi
CCECE
2009
IEEE
14 years 2 months ago
Automata-based approach for kernel trace analysis
This paper presents an automata-based approach for analyzing traces generated by the kernel of an operating system. We identified a list of typical patterns of problematic behavi...
Gabriel Matni, Michel Dagenais
FOSSACS
2007
Springer
14 years 2 months ago
A Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
Anca Muscholl, Igor Walukiewicz
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
14 years 2 months ago
Using conjugate symmetries to enhance gate-level simulations
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Peter M. Maurer