Decomposition in asynchronous circuit design

DOI10.1007/3-540-36206-1_30MaRDI QIDQ4415268zbMATH OpenFDO

Authors Ralf Wollowski, Walter Vogler

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560336.htm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Decomposition in asynchronous circuit design
• Decomposition of Asynchronous Sequential Switching Circuits
• Improved decomposition of signal transition graphs
• Component refinement and CSC-solving for STG decomposition
• Foundations of Software Science and Computational Structures

Cited in

(10)

• Component refinement and CSC-solving for STG decomposition
• Combining Decomposition and Unfolding for STG Synthesis
• scientific article; zbMATH DE number 3601533 (Why is no real title available?)
• Decomposition in asynchronous circuit design
• Building asynchronous circuits with JBits
• scientific article; zbMATH DE number 2112981 (Why is no real title available?)
• Improved decomposition of signal transition graphs
• Decomposition of Asynchronous Sequential Switching Circuits
• Foundations of Software Science and Computational Structures
• Applications and Theory of Petri Nets 2005

Describes a project that uses

Uses Software

• CASCADE

This page was built for publication: Decomposition in asynchronous circuit design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415268)