On the public citation graph

A region-based theory for state assignment in speed-independent circuits

0 signed · 83 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07135-0_113openalex-snapshot
A fundamental theorem of asynchronous parallel computation
inferredcites →https://doi.org/10.1007/3-540-58152-9_23openalex-snapshot
Petri net analysis using boolean manipulation
inferredcites →https://doi.org/10.1007/978-1-4471-3078-9_5openalex-snapshot
On The Synchronic Structure of Transition Systems
inferredcites →https://doi.org/10.1007/978-1-4615-3212-5openalex-snapshot
Algorithms for Synthesis and Testing of Asynchronous Circuits
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/0304-3975(92)90180-nopenalex-snapshot
Elementary transition systems
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.707587openalex-snapshot
Deriving Petri nets from finite transition systems
inferredcites →https://doi.org/10.1109/43.177405openalex-snapshot
Optimized synthesis of asynchronous control circuits from graph-theoretic specifications
inferredcites →https://doi.org/10.1109/43.402496openalex-snapshot
Asynchronous circuit synthesis with Boolean satisfiability
inferredcites →https://doi.org/10.1109/5.24143openalex-snapshot
Petri nets: Properties, analysis and applications
inferredcites →https://doi.org/10.1109/92.502196openalex-snapshot
Four-phase micropipeline latch control circuits
inferredcites →https://doi.org/10.1109/async.1996.494436openalex-snapshot
Complete state encoding based on the theory of regions
inferredcites →https://doi.org/10.1109/dac.1996.545547openalex-snapshot
Methodology and tools for state encoding in asynchronous circuit synthesis
inferredcites →https://doi.org/10.1109/edac.1991.206389openalex-snapshot
Formal method for self-timed design
inferredcites →https://doi.org/10.1109/edtc.1995.470376openalex-snapshot
Checking signal transition graph implementability by symbolic BDD traversal
inferredcites →https://doi.org/10.1109/iccad.1990.129875openalex-snapshot
Optimized synthesis of asynchronous control circuits from graph-theoretic specifications
inferredcites →https://doi.org/10.1109/iccad.1991.185264openalex-snapshot
Automatic synthesis of locally-clocked asynchronous state machines
inferredcites →https://doi.org/10.1109/iccad.1992.279309openalex-snapshot
Automatic gate-level synthesis of speed-independent circuits
inferredcites →https://doi.org/10.1109/iccad.1992.279310openalex-snapshot
Automatic synthesis of 3D asynchronous state machines
inferredcites →https://doi.org/10.1109/iccad.1992.279388openalex-snapshot
On the verification of state-coding in STGs
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.1995.480008openalex-snapshot
Synthesizing Petri nets from state-based models
inferredcites →https://doi.org/10.1109/iccd.1993.393386openalex-snapshot
An efficient unique state coding algorithm for signal transition graphs
inferredcites →https://doi.org/10.1109/iccd.1995.528943openalex-snapshot
Efficient state assignment framework for asynchronous state graphs
inferredcites →https://doi.org/10.1109/wcadm.1995.514649openalex-snapshot
Optimised state assignment for asynchronous circuit synthesis
inferredcites →https://doi.org/10.1145/196244.196275openalex-snapshot
Basic gate implementation of speed-independent circuits
inferredcites →https://doi.org/10.1145/240518.240531openalex-snapshot
Methodology and tools for state encoding in asynchronous circuit synthesis
inferredcites →https://doi.org/10.21236/ada444293openalex-snapshot
A Synthesis Method for Self-Timed VLSI Circuits
inferredcites →https://doi.org/10.25405/ncl.34292163openalex-snapshot
Signal Graphs: from Self-Timed to Timed Ones
inferredcites →https://doi.org/10.25405/ncl.34292169openalex-snapshot
Signal graphs: a model for designing concurrent logic
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.5555/951513.951556openalex-snapshot
Formal method for self-timed design
inferredcites →https://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471224146.biblioopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/047134608x.w7604openalex-snapshot
Asynchronous Logic Design
inferred← citeshttps://doi.org/10.1002/9781119517528.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_38openalex-snapshot
The Complexity of Synthesis for 43 Boolean Petri Net Types
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_10openalex-snapshot
Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_9openalex-snapshot
Hardness Results for the Synthesis of b-bounded Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-61739-4_10openalex-snapshot
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_13openalex-snapshot
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_15openalex-snapshot
Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_12openalex-snapshot
Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues
inferred← citeshttps://doi.org/10.1007/978-3-031-10363-6_2openalex-snapshot
Complexity of Distributed Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_9openalex-snapshot
Synthesis of Asynchronous Hardware from Petri Nets
inferred← citeshttps://doi.org/10.1016/b978-0-12-373892-9.00009-8openalex-snapshot
On-Chip Communication Architecture Refinement and Interface Synthesis
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.014openalex-snapshot
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
inferred← citeshttps://doi.org/10.1049/ip-cdt:20030831openalex-snapshot
Visualisation and resolution of encoding conflicts in asynchronous circuit design
inferred← citeshttps://doi.org/10.1049/ip-cdt:20045094openalex-snapshot
Clockless circuits and system synthesis
inferred← citeshttps://doi.org/10.1080/17517570802245433openalex-snapshot
Getting rid of OR-joins and multiple start events in business process models
inferred← citeshttps://doi.org/10.1109/43.784116openalex-snapshot
Decomposition and technology mapping of speed-independent circuits using Boolean relations
inferred← citeshttps://doi.org/10.1109/43.980253openalex-snapshot
Lazy transition systems and asynchronous circuit synthesis with relative timing assumptions
inferred← citeshttps://doi.org/10.1109/5.740027openalex-snapshot
Logic decomposition of speed-independent circuits
inferred← citeshttps://doi.org/10.1109/access.2018.2872678openalex-snapshot
State-Based Encoding of Large Asynchronous Controllers
inferred← citeshttps://doi.org/10.1109/async.2002.1000302openalex-snapshot
Relative timing based verification of timed circuits and systems
inferred← citeshttps://doi.org/10.1109/async.2018.00013openalex-snapshot
State Encoding of Asynchronous Controllers Using Pseudo-Boolean Optimization
inferred← citeshttps://doi.org/10.1109/async.2019.00017openalex-snapshot
Synthesis from Waveform Transition Graphs
inferred← citeshttps://doi.org/10.1109/csd.2001.981773openalex-snapshot
A structural encoding technique for the synthesis of asynchronous circuits
inferred← citeshttps://doi.org/10.1109/dac.2006.229414openalex-snapshot
State encoding of large asynchronous controllers
inferred← citeshttps://doi.org/10.1109/date.2003.1253724openalex-snapshot
Visualization and resolution of coding conflicts in asynchronous circuit design
inferred← citeshttps://doi.org/10.1109/edoc.2007.10openalex-snapshot
Getting Rid of the OR-Join in Business Process Models
inferred← citeshttps://doi.org/10.1109/iccad.1999.810669openalex-snapshot
Synthesis of asynchronous control circuits with automatically generated relative timing assumptions
inferred← citeshttps://doi.org/10.1109/isac364032.2025.11156586openalex-snapshot
Domain-Adaptive Transfer Learning Framework for Multimodal Technical Communication in VLSI Engineering
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210084openalex-snapshot
Petri net based interface analysis for fast IP-core integration
inferred← citeshttps://doi.org/10.1109/sbcci.2003.1232818openalex-snapshot
A fast IP-core integration methodology for SoC design
inferred← citeshttps://doi.org/10.1109/tcad.2007.907238openalex-snapshot
Encoding Large Asynchronous Controllers With ILP Techniques
inferred← citeshttps://doi.org/10.1109/tcsi.2002.805704openalex-snapshot
STG-level decomposition and resynthesis of speed-independent circuits
inferred← citeshttps://doi.org/10.1145/1146909.1147148openalex-snapshot
State encoding of large asynchronous controllers
inferred← citeshttps://doi.org/10.1145/2660540.2661007openalex-snapshot
A novel State Assignment method for Extended Burst-Mode FSM design using Genetic Algorithm
inferred← citeshttps://doi.org/10.1145/277044.277046openalex-snapshot
Asynchronous interface specification, analysis and synthesis
inferred← citeshttps://doi.org/10.1145/996566.996788openalex-snapshot
Decomposing specifications with concurrent outputs to resolve state coding conflicts in asynchronous logic synthesis
inferred← citeshttps://doi.org/10.1155/2015/651785openalex-snapshot
A Discrete Event System Approach to Online Testing of Speed Independent Circuits
inferred← citeshttps://doi.org/10.25405/ncl.34122150openalex-snapshot
Decomposition and Technology Mapping of Speed-Independent Circuits Using Boolean Relations
inferred← citeshttps://doi.org/10.25405/ncl.34148985openalex-snapshot
Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design
inferred← citeshttps://doi.org/10.3233/fi-2021-2084openalex-snapshot
The Complexity of Synthesis of $b$-Bounded Petri Nets
inferred← citeshttps://doi.org/10.3233/fi-222136openalex-snapshot
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
inferred← citeshttps://doi.org/10.4204/eptcs.324.7openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
inferred← citeshttps://doi.org/10.48550/arxiv.1904.01094openalex-snapshot
Hardness Results for the Synthesis of $b$-bounded Petri Nets (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12372openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)
inferred← citeshttps://doi.org/10.5555/339492.340034openalex-snapshot
Synthesis of asynchronous control circuits with automatically generated relative timing assumptions
inferred← citeshttps://doi.org/10.5555/823453.823846openalex-snapshot
Petri net based interface analysis for fast IP-core integration
inferred← citeshttps://doi.org/10.5821/dissertation-2117-131423openalex-snapshot
Synthesis of variability-tolerant circuits with adaptive clocking
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.