Newtonian arbiters cannot be proven correct

DOI10.1007/BF01384075zbMATH Open0786.94024MaRDI QIDQ1314513

Terry Stroup, Michael Mendler

Publication date: 17 February 1994

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

unprovabilitysynchronization problemabstract specificationNewtonian arbiters

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• General theory of metastable operation
• Hardware Specification with Temporal Logic: An Example
• The Effect of Asynchronous Inputs on Sequential Network Reliability
• Asynchronous Sequential Switching Circuits with Unrestricted Input Changes

Related Items (2)

Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip ⋮ Title not available (Why is that?)

This page was built for publication: Newtonian arbiters cannot be proven correct

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314513)