DMCA
P-time Unique State Coding Algorithms for Signal Transition Graphs (1993)
BibTeX
@MISC{Pastor93p-timeunique,
author = {Enric Pastor and Enric Pastor and Jordi Cortadella and Jordi Cortadella},
title = {P-time Unique State Coding Algorithms for Signal Transition Graphs},
year = {1993}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Current algorithms to force the Complete State Coding (CSC) property for Signal Transition Graphs (STGs) work on the State Graph and, therefore require exponential time and space. Polynomial algorithms have been only proposed for Marked Graphs. In this paper, a P-time algorithm for Unique State Coding (USC) is presented. Although more restrictive than CSC, it is shown that the USC property can be efficiently guaranteed for large STGs. Several experiments evidence that the obtained results are even better than those generated by exponential-time techniques. 1 Introduction Signal Transition Graphs (STGs) are a subclass of interpreted Petri nets originally presented in [Chu87] for the specification of asynchcronous circuits. Since then, different synthesis techniques have been proposed in order to automatically produce hazard-free implementations [MBM89, LKSV91]. One of the necessary conditions for an STG to be implementable is the Complete State Coding (CSC) property, which guarantees t...
Keyphrases
signal transition graph p-time unique state coding algorithm complete state coding state graph p-time algorithm usc property marked graph necessary condition unique state coding exponential time hazard-free implementation large stgs different synthesis technique interpreted petri net polynomial algorithm introduction signal transition graph current algorithm several experiment evidence exponential-time technique asynchcronous circuit
