Sciweavers

1279 search results - page 22 / 256
» Fast Implementations of Automata Computations
Sort
View
CSR
2006
Springer
13 years 11 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
FORMATS
2009
Springer
14 years 2 months ago
Exploiting Timed Automata for Conformance Testing of Power Measurements
For software development, testing is still the primary choice for investigating the correctness of a system. Automated testing is of utmost importance to support continuous integra...
Matthias Woehrle, Kai Lampka, Lothar Thiele
ARITH
1999
IEEE
13 years 12 months ago
Intermediate Variable Encodings that Enable Multiplexor-Based Implementations of Two Operand Addition
In two operand addition, bit-wise intermediate variables such as the "propagate" and "generate" terms are defined/evaluated first. Basic carry propagation recu...
Dhananjay S. Phatak, Israel Koren
IPPS
1999
IEEE
13 years 12 months ago
Plastic Cell Architecture: A Dynamically Reconfigurable Hardware-Based Computer
This paper describes a dynamically reconfigurable hardware-based computer called the Plastic Cell Architecture (PCA). PCA consists of dualstructured sea-of -cells that consist of a...
Hiroshi Nakada, Kiyoshi Oguri, Norbert Imlig, Mino...
RTA
2007
Springer
14 years 1 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...