Results 1  10
of
23
Synthesis of speed independent circuits based on decomposition
 In ASYNC 2004
, 2004
"... This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesizes each output individually. It begins by contracting the STG to include only transitions on the output of interest and ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesizes each output individually. It begins by contracting the STG to include only transitions on the output of interest and its trigger signals. Next, the reachable state space for this contracted STG is analyzed to determine a minimal number of additional signals which must be reintroduced into the STG to obtain CSC. The circuit for this output is then synthesized from this STG. Results show that the quality of the circuit implementation is nearly as good as the one found from the full reachable state space, but it can be applied to find circuits for which full state space methods cannot be successfully applied. The proposed method has been implemented as a part of our tool nutas (NiiUtah Timed Asynchronous circuit Synthesis system), and its very first version is available at
Strategies for optimised STG decomposition
 In Proceedings of ACSD
, 2006
"... Abstract — When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into smaller components. This paper deals with the decomposition method of [11], [12] and introduces several strategies for ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
Abstract — When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into smaller components. This paper deals with the decomposition method of [11], [12] and introduces several strategies for efficient implementations, proves them correct and compares them by means of benchmark examples.
Modal Interface Automata
 Logical Methods in Computer Science 9(3:4
, 2013
"... cent combination IOMTS of IA and Larsen’s Modal Transition Systems (MTS) are established frameworks for specifying interfaces of system components. However, neither IA nor IOMTS consider conjunction that is needed in practice when a component shall satisfy multiple interfaces, while Larsen’s MTSco ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
cent combination IOMTS of IA and Larsen’s Modal Transition Systems (MTS) are established frameworks for specifying interfaces of system components. However, neither IA nor IOMTS consider conjunction that is needed in practice when a component shall satisfy multiple interfaces, while Larsen’s MTSconjunction is not closed and Benes ̌ et al.’s conjunction on disjunctive MTS does not treat internal transitions. In addition, IOMTSparallel composition exhibits a compositionality defect. This article defines conjunction (and also disjunction) on IA and disjunctive MTS and proves the operators to be ‘correct’, i.e., the greatest lower bounds (least upper bounds) wrt. IA and resp. MTSrefinement. As its main contribution, a novel interface theory called Modal Interface Automata (MIA) is introduced: MIA is a rich subset of IOMTS featuring explicit outputmusttransitions while inputtransitions are always allowed implicitly, is equipped with compositional parallel, conjunction and disjunction operators, and allows a simpler embedding of IA than Nyman’s. Thus, it fixes the shortcomings of related work, without restricting designers to deterministic interfaces as Raclet et al.’s modal interface theory does. 1.
Combining decomposition and unfolding for STG synthesis
 IN PROC. ATPN’07
, 2007
"... For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime com ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.
Outputdeterminacy for asynchronous circuit synthesis
, 2007
"... Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic STGs with dummies and ORcausality. For this, we introduce the concept of outputdeterminacy, which is a relaxation of d ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic STGs with dummies and ORcausality. For this, we introduce the concept of outputdeterminacy, which is a relaxation of determinism, and argue that it is reasonable and useful in the speedindependent context. With our theory we improve an STG decomposition algorithm, which can alleviate state explosion.
Component Refinement and CSC Solving for STG Decomposition
, 2004
"... STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors. In this pap ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors. In this paper it is studied how CSC solving (which is essential for circuit synthesis) can be combined with decomposition. For this purpose the correctness definition for decomposition is enhanced with internal signals and it is shown that speedindependent CSC solving preserves correctness. The latter uses a more general result about correctness of topdown decomposition. Furthermore, we apply our definition to give the first correctness proof for the decomposition method of Carmona and Cortadella [CC03].
Synthesis of Timed Circuits Based on Decomposition
"... Abstract—This paper presents a decompositionbased method for timed circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesizes each output individually. It begins by contracting the timed signal transition graph (STG) to include only transi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract—This paper presents a decompositionbased method for timed circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesizes each output individually. It begins by contracting the timed signal transition graph (STG) to include only transitions on the output of interest and its possible trigger signals. Next, the reachable state space for this contracted STG is analyzed to determine a minimal number of additional signals, which must be reintroduced into the STG to obtain complete state coding. The circuit for this output is then synthesized from this STG. Results show that the quality of the circuit implementation is nearly as good as the one found from the full reachable state space, but it can be applied to find circuits for which fullstatespace methods cannot be successfully applied. The proposed method has been implemented as a part of our tool NiiUtah Timed Asynchronous circuit Synthesis system (nutas), and its first version is available at
Improved Parallel Composition of Labelled Petri Nets
"... Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a ‘messy’ Petri net, with many implicit pla ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a ‘messy’ Petri net, with many implicit places, causing performance deterioration in tools that are based on structural methods. In this paper we propose an optimised algorithm for computing the parallel composition. It often produces nets with fewer implicit places, which are thus better suited for subsequent application of structural methods. Keywords: parallel composition, resynthesis, STG, asynchronous circuits.
Improved decomposition of STGs
 In ACSD ’05: Proceedings of the Fifth International Conference on Application of Concurrency to System Design
, 2005
"... Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explos ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explosion or allowing the use of library elements. In a previous paper, the original method was extended and shown to be much more generally applicable than known before. But further extensions are necessary, and some are presented here, e.g.: to avoid dynamic autoconflicts, the previous paper insisted on avoiding structural autoconflicts, which is too restrictive; we show how to work with the latter type of autoconflicts. This and another simple extension makes it necessary to restructure presentation and correctness proof of the decomposition algorithm. 1