On the public citation graph

Trace Theory and VLSJ Design

https://doi.org/10.1007/bfb0031414
0 signed · 70 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w7604openalex-snapshot
Asynchronous Logic Design
inferred← citeshttps://doi.org/10.1007/11423348_7openalex-snapshot
Implementation of Handshake Components
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_33openalex-snapshot
COSY: Its relation to nets and to CSP
inferred← citeshttps://doi.org/10.1007/3-540-17943-7_118openalex-snapshot
Trace theory and systolic computations
inferred← citeshttps://doi.org/10.1007/3-540-36190-1_1openalex-snapshot
Composing Snippets
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_13openalex-snapshot
Latency Insensitive Protocols
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_59openalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_8openalex-snapshot
Recent developments in the design of asynchronous circuits
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_80openalex-snapshot
From trace specifications to process terms
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_31openalex-snapshot
Partial-order model checking: A guide for the perplexed
inferred← citeshttps://doi.org/10.1007/3-540-65307-4_49openalex-snapshot
Petri nets and digital hardware design
inferred← citeshttps://doi.org/10.1007/3540512845_49openalex-snapshot
Implementation conditions for delay insensitive circuits
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_18openalex-snapshot
High-level circuit design
inferred← citeshttps://doi.org/10.1007/978-1-4471-3182-3_8openalex-snapshot
The Nature of Delay-Insensitive Computing
inferred← citeshttps://doi.org/10.1007/978-1-4471-3575-3_2openalex-snapshot
Parallel Program and Asynchronous Circuit Design
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_3openalex-snapshot
A Denotational Semantics for Synchronous and Asynchronous Behavior with Multiform Time
inferred← citeshttps://doi.org/10.1007/978-1-4612-3462-3_62openalex-snapshot
Discrete Event Systems and Deadlock
inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_3openalex-snapshot
Specification-driven Design of Custom Hardware in HOP
inferred← citeshttps://doi.org/10.1007/978-1-4615-3990-2_3openalex-snapshot
Synthesis of Self-Timed Circuits
inferred← citeshttps://doi.org/10.1007/978-1-4615-3996-4_8openalex-snapshot
Design of Asynchronous Parallel Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4757-3281-8_16openalex-snapshot
Models of asynchronous computation
inferred← citeshttps://doi.org/10.1007/978-3-0348-9120-2_4openalex-snapshot
An Overview of Results in Discrete Event Systems Using a Trace Theory Based Setting
inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_2openalex-snapshot
A Specification Theory of Real-Time Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_22openalex-snapshot
Team Automata Satisfying Compositionality
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_37openalex-snapshot
Specification and Verification of Asynchronous Circuits Using Marked Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_15openalex-snapshot
Systematic Derivation of Communicating Programs
inferred← citeshttps://doi.org/10.1007/bf00276020openalex-snapshot
Predicate-transformer semantics of general recursion
inferred← citeshttps://doi.org/10.1007/bf01178564openalex-snapshot
Receptive process theory
inferred← citeshttps://doi.org/10.1007/bf01214621openalex-snapshot
Progress assumption in concurrent systems
inferred← citeshttps://doi.org/10.1007/bf01660032openalex-snapshot
A formal model for defining and classifying delay-insensitive circuits and systems
inferred← citeshttps://doi.org/10.1007/bf01660033openalex-snapshot
On the existence of delay-insensitive fair arbiters: Trace theory and its limitations
inferred← citeshttps://doi.org/10.1007/bf01660034openalex-snapshot
Compiling communicating processes into delay-insensitive VLSI circuits
inferred← citeshttps://doi.org/10.1007/bf01797161openalex-snapshot
Locked discrete event systems: How to model and how to unlock
inferred← citeshttps://doi.org/10.1007/bf02252954openalex-snapshot
A formal approach to designing delay-insensitive circuits
inferred← citeshttps://doi.org/10.1007/bfb0013979openalex-snapshot
A real time process logic
inferred← citeshttps://doi.org/10.1007/bfb0022689openalex-snapshot
How to please authors and publishers: A versatile document preparation system at karlsruhe
inferred← citeshttps://doi.org/10.1007/bfb0023728openalex-snapshot
Using partial-order semantics to avoid the state explosion problem in asynchronous systems
inferred← citeshttps://doi.org/10.1007/bfb0042306openalex-snapshot
Using trace theory to model discrete events
inferred← citeshttps://doi.org/10.1007/bfb0054295openalex-snapshot
Slack elasticity in concurrent computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.04.007openalex-snapshot
Synchronized shuffles
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00273-xopenalex-snapshot
Delay-insensitivity and ternary simulation
inferred← citeshttps://doi.org/10.1023/a:1022902408130openalex-snapshot
True Concurrency in Models of Asynchronous Circuit Behavior
inferred← citeshttps://doi.org/10.1049/ip-e.1990.0004openalex-snapshot
Hierarchical design of delay-insensitive systems
inferred← citeshttps://doi.org/10.1049/ip-e.1993.0011openalex-snapshot
Structural technique for fault-masking in asynchronous interfaces
inferred← citeshttps://doi.org/10.1098/rsta.2005.1649openalex-snapshot
Computing and the cultures of proving
inferred← citeshttps://doi.org/10.1109/12.123377openalex-snapshot
An efficient implementation of Boolean functions as self-timed circuits
inferred← citeshttps://doi.org/10.1109/32.58782openalex-snapshot
The specification and verified decomposition of system requirements using CSP
inferred← citeshttps://doi.org/10.1109/43.329261openalex-snapshot
A correctness criterion for asynchronous circuit validation and optimization
inferred← citeshttps://doi.org/10.1109/43.41504openalex-snapshot
Automatic synthesis of asynchronous circuits from high-level specifications
inferred← citeshttps://doi.org/10.1109/43.945302openalex-snapshot
Theory of latency-insensitive design
inferred← citeshttps://doi.org/10.1109/78.80917openalex-snapshot
Asynchronous design for programmable digital signal processors
inferred← citeshttps://doi.org/10.1109/async.1994.656285openalex-snapshot
Characterizing speed-independence of high-level designs
inferred← citeshttps://doi.org/10.1109/async.1994.656312openalex-snapshot
Efficient building blocks for delay insensitive circuits
inferred← citeshttps://doi.org/10.1109/async.1996.494450openalex-snapshot
The energy and entropy of VLSI computations
inferred← citeshttps://doi.org/10.1109/async.1996.494453openalex-snapshot
Combining process algebras and Petri nets for the specification and synthesis of asynchronous circuits
inferred← citeshttps://doi.org/10.1109/async.1998.666503openalex-snapshot
Analyzing specifications for delay-insensitive circuits
inferred← citeshttps://doi.org/10.1109/cmpass.1990.175409openalex-snapshot
Using CSP to develop trustworthy hardware
inferred← citeshttps://doi.org/10.1109/edac.1991.206431openalex-snapshot
The VLSI-programming language Tangram and its translation into handshake circuits
inferred← citeshttps://doi.org/10.1109/edtc.1995.470406openalex-snapshot
Modeling and optimization of hierarchical synchronous circuits
inferred← citeshttps://doi.org/10.1109/ftdcs.1988.26697openalex-snapshot
A tool for the synthesis of discrete controllers for distributed systems
inferred← citeshttps://doi.org/10.1109/hicss.1993.270633openalex-snapshot
From trace graphs to modular delay-insensitive circuits
inferred← citeshttps://doi.org/10.1109/hicss.1993.270634openalex-snapshot
A verifier for network decompositions of command-based specifications
inferred← citeshttps://doi.org/10.1109/iccad.1989.76949openalex-snapshot
Translating concurrent programs into delay-insensitive circuits
inferred← citeshttps://doi.org/10.1109/iccad.2014.7001371openalex-snapshot
Removing concurrency for rapid functional verification
inferred← citeshttps://doi.org/10.1109/iccd.1988.25681openalex-snapshot
VLSI programming
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487889openalex-snapshot
Deterministic receptive processes are kahn processes
inferred← citeshttps://doi.org/10.1109/tcad.2003.816214openalex-snapshot
Modular verification of timed circuits using automatic abstraction
inferred← citeshttps://doi.org/10.1109/wescon.1994.403628openalex-snapshot
Introduction to use of formal methods in software and hardware
inferred← citeshttps://doi.org/10.18653/v1/2022.sigdial-1.31openalex-snapshot
Inferring Ranked Dialog Flows from Human-to-Human Conversations
inferred← citeshttps://doi.org/10.70675/bd48f7ebz9c21z4ac6z9970z7725b0a53beaopenalex-snapshot
Efficient finite-state algorithms for the application of local grammars
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.