On the public citation graph
Designing asynchronous circuits from behavioural specifications with internal conflicts
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02108192openalex-snapshot
A generalized state assignment theory for transformations on signal transition graphs
inferredcites →https://doi.org/10.1016/s0167-9260(86)80002-5openalex-snapshot
On the models for designing VLSI asynchronous digital systems
inferredcites →https://doi.org/10.1109/12.2252openalex-snapshot
Q-modules: internally clocked delay-insensitive modules
inferredcites →https://doi.org/10.1109/iccad.1989.76950openalex-snapshot
Practicality of state-machine verification of speed-independent circuits
inferredcites →https://doi.org/10.1109/iccad.1992.279389openalex-snapshot
A generalized state assignment theory for transformations on signal transition graphs
inferredcites →https://doi.org/10.1109/iccad.1992.279390openalex-snapshot
A unified signal transition graph model for asynchronous control circuit synthesis
inferredcites →https://doi.org/10.1109/iccad.1993.580065openalex-snapshot
Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs
inferredcites →https://doi.org/10.25405/ncl.34292163openalex-snapshot
Signal Graphs: from Self-Timed to Timed Ones
inferredcites →https://doi.org/10.5555/259794.259837openalex-snapshot
Polynomial algorithms for the synthesis for hazard-free circuits from signal transition graphs
inferredcites →https://doi.org/10.5555/304032.304070openalex-snapshot
A generalized state assignment theory for transformations on signal transition graphs
inferredcites →https://doi.org/10.5860/choice.28-2760openalex-snapshot
Principles of concurrent and distributed programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-65307-4_49openalex-snapshot
Petri nets and digital hardware design
inferred← citeshttps://doi.org/10.1007/978-1-4471-3575-3_1openalex-snapshot
Asynchronous Circuit Design: Motivation, Background, & Methods
inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_1openalex-snapshot
Comprehensive Causal Specification of Asynchronous Controller and Arbiter Behaviour
inferred← citeshttps://doi.org/10.1023/a:1008649930696openalex-snapshot
Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets
inferred← citeshttps://doi.org/10.1109/43.720313openalex-snapshot
Hazard-free implementation of speed-independent circuits
inferred← citeshttps://doi.org/10.1109/43.743711openalex-snapshot
Automatic synthesis of extended burst-mode circuits. I. (Specification and hazard-free implementations)
inferred← citeshttps://doi.org/10.1109/acsd.2019.00005openalex-snapshot
Generalised Asynchronous Arbiter
inferred← citeshttps://doi.org/10.1109/aspdac.1999.760008openalex-snapshot
Recent advances in asynchronous design methodologies
inferred← citeshttps://doi.org/10.1109/async.1996.494442openalex-snapshot
Some limitations to speed-independence in asynchronous circuits
inferred← citeshttps://doi.org/10.1109/async.1999.761530openalex-snapshot
From STG to extended-burst-mode machines
inferred← citeshttps://doi.org/10.1109/async.2018.00017openalex-snapshot
Design and Verification of Speed-Independent Circuits with Arbitration in Workcraft
inferred← citeshttps://doi.org/10.1109/date.2004.1268996openalex-snapshot
Asynchronous design by conversion: converting synchronous circuits into asynchronous ones
inferred← citeshttps://doi.org/10.1109/iccad.1995.480008openalex-snapshot
Synthesizing Petri nets from state-based models
inferred← citeshttps://doi.org/10.1109/tcad.2019.2907905openalex-snapshot
Automating the Design of Asynchronous Logic Control for AMS Electronics
inferred← citeshttps://doi.org/10.25405/ncl.34128840openalex-snapshot
Petri Net Models of Metastable Operations in Latch Circuits
inferred← citeshttps://doi.org/10.5555/968879.969197openalex-snapshot
Asynchronous design by conversion: converting synchronous circuits into asynchronous ones
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.