Sciweavers

12 search results - page 1 / 3
» Synthesis of Mealy Machines Using Derivatives
Sort
View
ENTCS
2006
114views more  ENTCS 2006»
13 years 6 months ago
Synthesis of Mealy Machines Using Derivatives
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
Helle Hvid Hansen, David Costa, Jan J. M. M. Rutte...
ALIFE
2000
13 years 6 months ago
Talking Helps: Evolving Communicating Agents for the Predator-Prey Pursuit Problem
We analyze a general model of multi-agent communication in which all agents communicate simultaneously to a message board. A genetic algorithm is used to evolve multi-agent languag...
Kam-Chuen Jim, C. Lee Giles
FAC
2008
123views more  FAC 2008»
13 years 5 months ago
Interface synthesis and protocol conversion
Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ...
Purandar Bhaduri, S. Ramesh
VLSID
2002
IEEE
174views VLSI» more  VLSID 2002»
14 years 6 months ago
Architecture Implementation Using the Machine Description Language LISA
The development of application specific instruction set processors comprises several design phases: architecture exploration, software tools design, system verification and design...
Oliver Schliebusch, Andreas Hoffmann, Achim Nohl, ...
DAC
1994
ACM
13 years 10 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton