Compiling communicating processes into delay-insensitive VLSI circuits

DOI10.1007/BF01660034zbMath0643.94039OpenAlexW2029005287MaRDI QIDQ1102258

Alain J. Martin

Publication date: 1986

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01660034

zbMATH Keywords

VLSI circuitscommunicating processesdelay-insensitive circuitsautomatic circuit synthesisself-timed systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

A new explanation of the glitch phenomenon, Retargeting a hardware compiler using protocol converters, Verification of asynchronous circuits by BDD-based model checking of Petri nets, Rewriting semantics of production rule sets, Revisiting sequential composition in process calculi, Reconciling fault-tolerant distributed computing and systems-on-chip, Calculational derivation of a counter with bounded response time and bounded power dissipation, Asynchronous datapaths and the design of an asynchronous adder, CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks, Asynchronous Logic Circuits and Sheaf Obstructions, Elasticity and Petri Nets, On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, A formal approach to designing delay-insensitive circuits, Compositional verification of asynchronous concurrent systems using CADP, Program refinement in fair transition systems

Cites Work

• Unnamed Item
• The probe: An addition to communication primitives
• Trace theory and VLSI design
• Communicating sequential processes