Sciweavers

903 search results - page 83 / 181
» Completeness Results for Memory Logics
Sort
View
VLSID
2006
IEEE
71views VLSI» more  VLSID 2006»
14 years 2 months ago
Clockless Pipelining for Coarse Grain Datapaths
In this paper, we present two novel synchronization approaches to support data flow in clockless designs using single-rail encoding. Both approaches are based on self-resetting st...
Abdelhalim Alsharqawi, Abdel Ejnioui
FUIN
2007
92views more  FUIN 2007»
13 years 8 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
DATE
2008
IEEE
115views Hardware» more  DATE 2008»
14 years 3 months ago
Improving the Efficiency of Run Time Reconfigurable Devices by Configuration Locking
Run-time reconfigurable logic is a very attractive alterative in the design of SoC. However, configuration overhead can largely decrease the system performance. In this work, we p...
Yang Qu, Juha-Pekka Soininen, Jari Nurmi
ENTCS
2006
146views more  ENTCS 2006»
13 years 8 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
APN
2001
Springer
14 years 1 months ago
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Mark-Oliver Stehr, José Meseguer, Peter Csa...