Trace theory and VLSI design

zbMath0616.68001MaRDI QIDQ1821550

Jan L. A. van de Snepscheut

Publication date: 1985

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

program representation; formal languages; concurrency; regular languages; traces; hardware implementation; VLSI chips; complexity of program design; delay-insensivity; hardware realization of programs; minimization of finite automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94C99: Circuits, networks

68Q70: Algebraic theory of languages and automata

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68N01: General topics in the theory of software

Related Items

Computing and the cultures of proving, Receptive process theory, A formal approach to designing delay-insensitive circuits, Modelling and verification of delay-insensitive circuits using CCS and the concurrency workbench, An alternative implementation of communication primitives, Compiling communicating processes into delay-insensitive VLSI circuits, On the existence of delay-insensitive fair arbiters: Trace theory and its limitations, Deadlock and fairness in morphisms of transition systems, Correctness of concurrent processes, Delay-insensitivity and ternary simulation, Locked discrete event systems: How to model and how to unlock, Progress assumption in concurrent systems, Infinite unfair shuffles and associativity, Synchronized shuffles