On specifications and proofs of timed circuits

DOI10.1007/978-3-031-22337-2_6zbMath1528.68220arXiv2208.08147OpenAlexW4313163471MaRDI QIDQ6113972

Ulrich Schmid, Matthias Függer, Christoph Lenzen

Publication date: 10 August 2023

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

Full work available at URL: https://arxiv.org/abs/2208.08147

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• HEX: scaling honeycombs is easier than scaling clock trees
• Reconciling fault-tolerant distributed computing and systems-on-chip
• Fault tolerance in the cardiac ganglion of the lobster
• A theory of timed automata
• Forward and backward simulations. I. Untimed Systems
• Forward and backward simulations. II: Timing-based systems
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
• Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
• Specification and Development of Interactive Systems
• Unfaithful Glitch Propagation in Existing Binary Circuit Models
• The Theory of Timed I/O Automata
• Complexity of network synchronization
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• General theory of metastable operation
• Self-stabilizing systems in spite of distributed control
• Time, clocks, and the ordering of events in a distributed system
• Metastability-Containing Circuits
• Fault-tolerant algorithms for tick-generation in asynchronous logic
• Asynchronous Sequential Switching Circuits with Unrestricted Input Changes

This page was built for publication: On specifications and proofs of timed circuits