Logic Synthesis for Asynchronous Controllers and Interfaces
From MaRDI portal
Publication:4802628
DOI10.1007/978-3-642-55989-1zbMath1013.68273OpenAlexW2130434989MaRDI QIDQ4802628
No author found.
Publication date: 22 April 2003
Published in: Springer Series in Advanced Microelectronics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55989-1
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer science aspects of computer-aided design (68U07)
Related Items (23)
HEX: scaling honeycombs is easier than scaling clock trees ⋮ Step semantics of Boolean nets ⋮ Step Persistence in the Design of GALS Systems ⋮ Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip ⋮ Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ Avoiding exponential explosion in Petri net models of control flows ⋮ Signal Transition Graphs for Asynchronous Data Path Circuits ⋮ Localities in systems with a/sync communication ⋮ Verification of asynchronous systems with an unspecified component ⋮ Component refinement and CSC-solving for STG decomposition ⋮ Asynchronous Logic Circuits and Sheaf Obstructions ⋮ A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks ⋮ Regions of Petri nets with a/sync connections ⋮ Elasticity and Petri Nets ⋮ Concurrency in synchronous systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Applying regions ⋮ An extension of the taxonomy of persistent and nonviolent steps ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ STG decomposition strategies in combination with unfolding ⋮ Target-oriented Petri Net Synthesis ⋮ Synthesising elementary net systems with localities ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
This page was built for publication: Logic Synthesis for Asynchronous Controllers and Interfaces
