#### Filter Results:

#### Publication Year

1991

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Variable-latency designs may improve the performance of those circuits in which the worst-case delay paths are infrequently activated. <i>Telescopic units</i> emerged as a scheme to automatically synthesize variable-latency circuits. In this paper, a novel approach is proposed that brings three main contributions with regard to the methods used for… (More)

—This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a state-based representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that, for any ETS, there… (More)

A simple protocol for latency-insensitive design is presented. The main features of the protocol are the efficient implementation of elastic communication channels and the automatable design methodology. With this approach, fine-granularity elasticity can be introduced at the level of functional units (e.g. ALUs, memories). A formal specification of the… (More)

The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the behavior of an event log. The most important property is that it produces a net with the smallest behavior that still contains the behavior of the event log. The methods described in… (More)

A protocol for latency-insensitive design with early evaluation is presented. The protocol is based on a symmetric view of the system in which tokens carrying information move in the forward direction and anti-tokens canceling information move in the backward direction. An implementation of the protocol and an example illustrate the flow for converting a… (More)

— Determining the cycle time and a critical cycle is a fundamental problem in the analysis of concurrent systems. We solve this problem using timing simulation of an underlying Signal Graph (an extension of Marked Graphs). For a Signal Graph with n vertices and m arcs our algorithm has the polynomial time complexity O(b 2 m), where b is the number of… (More)

microarchitectural models of communication fabrics present a challenge for verification. Due to the presence of deep pipelining, a large number of queues and distributed control, the state space of such models is usually too large for enumeration by protocol verification tools such as Murphi. On the other hand, we find that state-of-the-art rtl model… (More)

Avoiding message dependent deadlocks in communication fabrics is critical for modern microarchitectures. If discovered late in the design cycle, deadlocks lead to missed project deadlines and suboptimal design decisions. One approach to avoid this problem is to get high level of confidence on an early microarchitectural model. However, formal proofs of… (More)

Genet is a tool for the synthesis and mining of k-bounded Petri nets. The input of the tool is a transition system [2] specifying a behavior. The tool derives a Petri net (PN) [6] that has some relation with the input transition system. Depending on the usage of the tool, two possible outcomes are possible: 1. Synthesis [4]: the PN derived has a… (More)