Search

Dynamic digital timing analysis is a less accurate but fast alternative to highly accurate but slow analog simulations of digital circuits. It relies on gate delay models, which allow the determination of input-to-output delays of a gate on a per-transition basis. Accurate delay models not only consider the effect of preceding output transitions here but also delay variations induced by multi-input switching (MIS) effects in the case of multi-input gates. Starting out from a first-order hybrid delay model for CMOS two-input NOR gates, we develop a hybrid delay model for Muller C gates and show how to augment these models and their analytic delay formulas by a first-order interconnect. Moreover, we conduct a systematic evaluation of the resulting modeling accuracy: Using SPICE simulations, we quantify the MIS effects on the gate delays under various wire lengths, load capacitances, and input strengths for two different CMOS technologies, comparing these results to the predictions of appropriately parameterized versions of our new gate delay models. Overall, our experimental results reveal that they capture all MIS effects with a surprisingly good accuracy despite being first-order only.

Thresholded hybrid systems are restricted dynamical systems, where the current mode, and hence the ODE system describing its behavior, is solely determined by externally supplied digital input signals and where the only output signals are digital ones generated by comparing an internal state variable to a threshold value. An attractive feature of such systems is easy composition, which is facilitated by their purely digital interface. A particularly promising application domain of thresholded hybrid systems is digital integrated circuits: Modern digital circuit design considers them as a composition of Millions and even Billions of elementary logic gates, like inverters, GOR and Gand. Since every such logic gate is eventually implemented as an electronic circuit, however, which exhibits a behavior that is governed by some ODE system, thresholded hybrid systems are ideally suited for making the transition from the analog to the digital world rigorous. In this paper, we prove that the mapping from digital input signals to digital output signals is continuous for a large class of thresholded hybrid systems. Moreover, we show that, under some mild conditions regarding causality, this continuity also continues to hold for arbitrary compositions, which in turn guarantees that the composition faithfully captures the analog reality. By applying our generic results to some recently developed thresholded hybrid gate models, both for single-input single-output gates like inverters and for a two-input CMOS NOR gate, we show that they are continuous. Moreover, we provide a novel thresholded hybrid model for the two-input NOR gate, which is not only continuous but also, unlike the existing one, faithfully models all multi-input switching effects., Comment: There was a missing author from the last submission. arXiv admin note: substantial text overlap with arXiv:2303.14048

Quantum sensors based on the nitrogen-vacancy (NV) centre in diamond are rapidly advancing from scientific exploration towards the first generation of commercial applications. While significant progress has been made in developing suitable methods for the manipulation of the NV centre spin state, the detection of the defect luminescence has so far limited the performance of miniaturized sensor architectures. The recent development of photoelectric detection of the NV centre's spin state offers a path to circumvent these limitations, but has to-date required research-grade low current amplifiers to detect the picoampere-scale currents obtained from these systems. Here we report on the photoelectric detection of magnetic resonance (PDMR) with NV ensembles using a complementary metal-oxide semiconductor (CMOS) device. The integrated circuit delivers a digitized output of the diamond sensor with low noise and 50 femtoampere resolution. This integration provides the last missing component on the path to a compact, diamond-based quantum sensor. The device is suited for continuous wave (CW) as well as pulsed operation. We demonstrate its functionality with DC and AC magnetometry up to several megahertz, coherent spin rotation and multi-axial decoupling sequences for quantum sensing., Comment: 4 figures, 10 pages including bibliography, 8 pages not including bibliography

We provide an epistemic logical language and semantics for the modeling and analysis of byzantine fault-tolerant multi-agent systems. This not only facilitates reasoning about the agents' fault status but also supports model updates for implementing repair and state recovery. For each agent, besides the standard knowledge modality our logic provides an additional modality called hope, which is capable of expressing that the agent is correct (not faulty), and also dynamic modalities enabling change of the agents' correctness status. These dynamic modalities are interpreted as model updates that come in three flavours: fully public, more private, or involving factual change. We provide complete axiomatizations for all these variants in the form of reduction systems: formulas with dynamic modalities are equivalent to formulas without. Therefore, they have the same expressivity as the logic of knowledge and hope. Multiple examples are provided to demonstrate the utility and flexibility of our logic for modeling a wide range of repair and state recovery techniques that have been implemented in the context of fault-detection, isolation, and recovery (FDIR) approaches in fault-tolerant distributed computing with byzantine agents., Comment: Extended preprint

We demonstrate the first successful functionalization of epitaxial three-dimensional graphene with metal nanoparticles. The functionalization is obtained by immersing the 3D graphene in a nanoparticle colloidal solution. This method is versatile and here is demonstrated for gold and palladium, but can be extended to other types and shapes of nanoparticles. We have measured the nanoparticle density on the top-surface and in the porous layer volume by Scanning Electron Microscopy and Scanning Transmission Electron Microscopy. Samples exhibit a high coverage of nanoparticles with minimal clustering. High quality graphene has been demonstrated to promote the functionalization leading to higher nanoparticle density, both on the surface and in the pores. X-ray Photoelectron Spectroscopy allowed to verify the absence of contamination after the functionalization process. Moreover, it confirmed the thermal stability of the Au- and Pd-functionalized three-dimensional graphene up to 530{\deg}C. Our approach opens up new avenues for utilizing three-dimensional graphene as a versatile platform for catalytic applications, sensors, and energy storage and conversion.

Whereas distributed computing research has been very successful in exploring the solvability/impossibility border of distributed computing problems like consensus in representative classes of computing models with respect to model parameters like failure bounds, this is not the case for characterizing necessary and sufficient communication requirements. In this paper, we introduce network abstractions as a novel approach for modeling communication requirements in asynchronous distributed systems. A network abstraction of a run is a sequence of directed graphs on the set of processes, where the $i$-th graph specifies some ``potential'' message chains that can be guaranteed to arise in the $i$-th portion of the run. Formally, they are defined via associating message sending times with the end-to-end delays that would arise if the message was indeed sent by the sender's protocol. Network abstractions also allow to reason about future causal cones that might arise in a run, hence also facilitate reasoning about liveness properties, and are inherently compatible with temporal epistemic reasoning frameworks. We demonstrate the utility of our approach by providing necessary and sufficient network abstractions for solving the canonical firing rebels with relay (FRR) problem, and variants thereof, in asynchronous message-passing systems with up to $f$ byzantine processes connected via point-to-point links. FRR is not only a basic primitive in clock synchronization and consensus algorithms, but also integrates several distributed computing problems, namely triggering events, agreement and even stabilizing agreement, in a single problem instance., Comment: A preliminary version of this paper has been accepted at SIROCCO 2024

Sensors which are sensitive to volatile organic compounds and thus able to monitor the conservation state of food, are precious because they work non-destructively and allow to avoid direct contact with the food, ensuring hygienic conditions. In particular, the monitoring of rancidity would solve a widespread issue in food storage. The sensor discussed here is produced utilizing a novel three-dimensional arrangement of graphene, which is grown on a crystalline silicon carbide (SiC) wafer previously porousified by chemical etching. This approach allows a very high surface-to.volume ratio. Furthermore, the structure of the sensor surface features a large amount of edges, dangling bounds, and active sites, which make the sensor, on a chemically robust skeleton, chemically active, particularly to hydrogenated molecules. The interaction of the sensor with such compounds is read out by measuring the sensor resistance in a four wire configuration. The sensor performance has been assessed on three hazelnut samples: sound hazelnuts, spoiled hazelnuts, and stink bug hazelnuts. A resistance variation of about DeltaR = 0.13 (0.02) Ohm between sound and damaged hazelnuts has been detected. Our measurements confirm the ability of the sensor to discriminate between sound and damaged hazelnuts. The sensor signal is stable for days, providing the possibility to use this sensor for the monitoring of the storage state of fats and foods in general., Comment: 11 pages, 6 figures 1 table

Long-wave infrared (LWIR, 8-14 um) photonics is a rapidly growing research field within the mid-IR with applications in molecular spectroscopy and optical free-space communication. LWIR-applications are often addressed using rather bulky tabletop-sized free-space optical systems, preventing advanced photonic applications such as rapid-time-scale experiments. Here, device miniaturization into photonic integrated circuits (PICs) with maintained optical capabilities is key to revolutionize mid-IR photonics. Sub-wavelength mode confinement in plasmonic structures enabled such miniaturization approaches in the visible-to-near-IR spectral range. However, adopting plasmonics for the LWIR needs suitable low-loss and -dispersion materials with compatible integration strategies to existing mid-IR technology. In this work we further unlock the field of LWIR/mid-IR PICs, by combining photolithographic patterning of organic polymers with dielectric-loaded surface plasmon polariton (DLSPP) waveguides. In particular, polyethylene shows favorable optical properties, including low refractive index and broad transparency between ~2-200 um. We investigate the whole value chain, including design, fabrication, and characterization of polyethylene-based DLSPP waveguides and demonstrate their first-time plasmonic operation and mode guiding capabilities along s-bend structures. Low bending losses of ~1.3 dB and straight-section propagation lengths of ~1 mm, pave the way for unprecedented, complex on-chip mid-IR photonic devices. Moreover, DLSPPs allow full control of the mode parameters (propagation length and guiding capabilities) for precisely addressing advanced sensing and telecommunication applications with chip-scale devices.

Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communication is controlled by an oblivious message adversary. The question when consensus is possible in this model has already been studied thoroughly in the literature from a combinatorial perspective, and is known to be challenging. This paper presents a topological perspective on consensus solvability under oblivious message adversaries, which provides interesting new insights. Our main contribution is a topological characterization of consensus solvability, which also leads to explicit decision procedures. Our approach is based on the novel notion of a communication pseudosphere, which can be seen as the message-passing analog of the well-known standard chromatic subdivision for wait-free shared memory systems. We further push the elegance and expressiveness of the "geometric" reasoning enabled by the topological approach by dealing with uninterpreted complexes, which considerably reduce the size of the protocol complex, and by labeling facets with information flow arrows, which give an intuitive meaning to the implicit epistemic status of the faces in a protocol complex.

Existing protocols for byzantine fault tolerant distributed systems usually rely on the correct agents' ability to detect faulty agents and/or to detect the occurrence of some event or action on some correct agent. In this paper, we provide sufficient conditions that allow an agent to infer the appropriate beliefs from its history, and a procedure that allows these conditions to be checked in finite time. Our results thus provide essential stepping stones for developing efficient protocols and proving them correct., Comment: In Proceedings TARK 2023, arXiv:2307.04005

Thresholded mode-switched ODEs are restricted dynamical systems that switch ODEs depending on digital input signals only, and produce a digital output signal by thresholding some internal signal. Such systems arise in recent digital circuit delay models, where the analog signals within a gate are governed by ODEs that change depending on the digital inputs. We prove the continuity of the mapping from digital input signals to digital output signals for a large class of thresholded mode-switched ODEs. This continuity property is known to be instrumental for ensuring the faithfulness of the model w.r.t. propagating short pulses. We apply our result to several instances of such digital delay models, thereby proving them to be faithful.

The use of a novel three-dimensional graphene structure allows circumventing the limitations of the two-dimensional nature of graphene and its application in hydrogen absorption. Here we investigate hydrogen-bonding on monolayer graphene conformally grown via the epitaxial growth method on the (0001) face of a porousified 4H-SiC wafer. Hydrogen absorption is studied via Thermal Desorption Spectroscopy (TDS), exposing the samples to either atomic (D) or molecular (D2) deuterium. The graphene growth temperature, hydrogen exposure temperature, and the morphology of the structure are investigated and related to their effect on hydrogen absorption. The three-dimensional graphene structures chemically bind atomic deuterium when exposed to D2. This is the first report of such an event in unfunctionalized graphene-based materials and implies the presence of a catalytic splitting mechanism. It is further shown that the three-dimensional dendritic structure of the porous material temporarily retains the desorbed molecules and causes delayed emission. The capability of chemisorbing atoms after a catalytic splitting of hydrogen, coupled to its large surface-to-volume ratio, make these structures a promising substrate for hydrogen storage devices.

Dynamic digital timing analysis is a promising alternative to analog simulations for verifying particularly timing-critical parts of a circuit. A necessary prerequisite is a digital delay model, which allows to accurately predict the input-to-output delay of a given transition in the input signal(s) of a gate. Since all existing digital delay models for dynamic digital timing analysis are deterministic, however, they cannot cover delay fluctuations caused by PVT variations, aging and analog signal noise. The only exception known to us is the $\eta$-IDM introduced by F\"ugger et al. at DATE'18, which allows to add (very) small adversarially chosen delay variations to the deterministic involution delay model, without endangering its faithfulness. In this paper, we show that it is possible to extend the range of allowed delay variations so significantly that realistic PVT variations and aging are covered by the resulting extended $\eta$-IDM.

In order to facilitate the analysis of timing relations between individual transitions in a signal trace, dynamic digital timing analysis offers a less accurate but much faster alternative to analog simulations of digital circuits. This primarily requires gate delay models that also account for the fact that the input-to-output delay of a particular input transition also depends on the temporal distance to the previous output transitions. In the case of multi-input gates, the delay also experiences variations caused by multi-input switching (MIS) effects, i.e., transitions at different inputs that occur in close temporal proximity. In this paper, we advocate the development of hybrid delay models for CMOS gates obtained by replacing transistors with time-variant resistors. We exemplify our approach by applying it to a NOR gate (and, hence, to the dual NAND gate) and a Muller C gate. We analytically solve the resulting first-order differential equations with non-constant-coefficients, and derive analytic expressions for the resulting MIS gate delays. The resulting formulas not only pave the way to a sound model parametrization procedure, but are also instrumental for implementing fast and efficient digital timing simulation. By comparison with analog simulation data, we show that our models faithfully represent all relevant MIS effects. Using an implementation in the Involution Tool, we demonstrate that our model surpasses the alternative digital delay models for NOR gates known to us in terms of accuracy, with comparably short running times.

Given a discrete-state continuous-time reactive system, like a digital circuit, the classical approach is to first model it as a state transition system and then prove its properties. Our contribution advocates a different approach: to directly operate on the input-output behavior of such systems, without identifying states and their transitions in the first place. We discuss the benefits of this approach at hand of some examples, which demonstrate that it nicely integrates with concepts of self-stabilization and fault-tolerance. We also elaborate on some unexpected artefacts of module composition in our framework, and conclude with some open research questions., Comment: will be published in "Thomas Henzinger Festschrift - Conference celebrating his 60th birthday"

Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which computation and communication is lock-step synchronous but controlled by an oblivious message adversary. In this basic model, determining consensus solvability and designing consensus algorithms in the case where it is possible, has been shown to be surprisingly difficult. We present an explicit decision procedure to determine if consensus is possible under a given adversary. This in turn enables us, for the first time, to study the time complexity of consensus in this model. In particular, we derive time complexity upper bounds for consensus solvability both for a centralized decision procedure as well as for solving distributed consensus. We complement these results with time complexity lower bounds. Intriguingly, we find that reaching consensus under an oblivious message adversary can take exponentially longer than broadcasting the input value of some process to all other processes.

Nanoporous materials represent a versatile solution for a number of applications ranging from sensing, energy applications, catalysis, drug delivery, and many others. The synergy between the outstanding properties of graphene with a three-dimensional porous structure, circumventing the limits of its 2D nature, constitutes therefore a breakthrough for many fields. We report the first three-dimensional growth of epitaxial graphene on a porousified crystalline 4H-SiC(0001). The wafer porosification is performed via a sequence of metal-assisted photochemical and photoelectrochemical etching in hydrofluoric acid based electrolytes. Pore dimensions of the matrix have been evaluated by electron tomography resulting in an average diameter of 180 nm. Graphene growth is performed in an ultra high vacuum environment at a base pressure of $10^{-11}$ mbar. The graphene growth inside the pores is uniform as confirmed by Transmission Electron Microscopy (TEM) analysis. Raman spectroscopy confirms the high quality of the graphene with a 2D/G ratio $>1$ and an average graphene crystal size of $\approx$ 100 nm. Furthermore, it demonstrates a uniform coverage of graphene across the whole sample area. The surface-to-volume ratio of this novel material, its properties, the tunability of the pore size and the scalability of the surface porosification process offer a game changing perspective for a large number of applications.

Faithfully representing small gate delay variations caused by input switchings on different inputs in close temporal proximity is a very challenging task for digital delay models. In this paper, we use the example of a 2-input NOR gate to show that a simple hybrid model leads to a surprisingly accurate digital delay model. Our model utilizes simple first-order ordinary differential equations (ODEs) in all modes, resulting from considering transistors as ideal switches in a simple RC model of the gate. By analytically solving the resulting ODEs, we derive expressions for the gate delays, as well as formulas that facilitate model parametrization. It turns out that our model almost faithfully captures the Charlie effect, except in just one specific situation. In addition, we experimentally compare our model's predictions both to SPICE simulations, using some 15 nm technology, and to some existing delay models. Our results show a significant improvement of the achievable modeling accuracy., Comment: 9 pages, 14 figures, accepted for DATE'22

The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep connection with algebraic topology. We present a novel interpretation of this theorem, through the notion of continuous task, defined by an input/output specification that is a continuous function. To do so, we introduce a chromatic version of a foundational result for algebraic topology: the simplicial approximation theorem. In addition to providing a different proof of the ACT, the notion of continuous task seems interesting in itself. Indeed, besides the fact that certain distributed problems are naturally specified by continuous functions, continuous tasks have an expressive power that also allows to specify the density of desired outputs for each combination of possible inputs,for example.

In this paper, we provide an epistemic analysis of a simple variant of the fundamental consistent broadcasting primitive for byzantine fault-tolerant asynchronous distributed systems. Our Firing Rebels with Relay (FRR) primitive enables agents with a local preference for acting/not acting to trigger an action (FIRE) at all correct agents, in an all-or-nothing fashion. By using the epistemic reasoning framework for byzantine multi-agent systems introduced in our TARK'19 paper, we develop the necessary and sufficient state of knowledge that needs to be acquired by the agents in order to FIRE. It involves eventual common hope (a modality related to belief), which we show to be attained already by achieving eventual mutual hope in the case of FRR. We also identify subtle variations of the necessary and sufficient state of knowledge for FRR for different assumptions on the local preferences., Comment: In Proceedings TARK 2021, arXiv:2106.10886

We introduce the Composable Involution Delay Model (CIDM) for fast and accurate digital simulation. It is based on the Involution Delay Model (IDM) [F\"ugger et al., IEEE TCAD 2020], which has been shown to be the only existing candidate for faithful glitch propagation known so far. In its present form, however, it has shortcomings that limit its practical applicability and utility. First, IDM delay predictions are conceptually based on discretizing the analog signal waveforms using specific matching input and output discretization threshold voltages. Unfortunately, they are difficult to determine and typically different for interconnected gates. Second, metastability and high-frequency oscillations in a real circuit could be invisible in the IDM signal predictions. Our CIDM reduces the characterization effort by allowing independent discretization thresholds, improves composability and increases the modeling power by exposing canceled pulse trains at the gate interconnect. We formally show that, despite these improvements, the CIDM still retains the IDM's faithfulness, which is a consequence of the mathematical properties of involution delay functions., Comment: 13 pages, 9 figures, extended version of conference submission

Optical microcavities allow to strongly confine light in small mode volumes and with long photon lifetimes. This confinement significantly enhances the interaction between light and matter inside the cavity, with applications such as optical trapping and cooling of nanoparticles, single-photon emission enhancement, quantum information processing, and sensing. For many applications, open resonators with direct access to the mode volume are necessary. Here we report on a scalable, open-access optical microcavity platform with mode volumes < 30 $\lambda^3$ and finesse approaching $5x10^5$. This result significantly exceeds the highest optical enhancement factors achieved to date for Fabry-P\'erot cavities. The platform provides a building block for high-performance quantum devices relying on strong light-matter interaction.

Recently, a detailed epistemic reasoning framework for multi-agent systems with byzantine faulty asynchronous agents and possibly unreliable communication was introduced. We have developed a modular extension framework implemented on top of it, which allows to encode and safely combine additional system assumptions commonly used in the modeling and analysis of fault-tolerant distributed systems, like reliable communication, time-bounded communication, multicasting, synchronous and lock-step synchronous agents and even agents with coordinated actions. We use this extension framework for analyzing basic properties of synchronous and lock-step synchronous agents, such as the agents' local and global fault detection abilities. Moreover, we show that even the perfectly synchronized clocks available in lock-step synchronous systems cannot be used to avoid "brain-in-a-vat" scenarios., Comment: 34 pages, 2 figures

Accurate delay models are important for static and dynamic timing analysis of digital circuits, and mandatory for formal verification. However, F\"ugger et al. [IEEE TC 2016] proved that pure and inertial delays, which are employed for dynamic timing analysis in state-of-the-art tools like ModelSim, NC-Sim and VCS, do not yield faithful digital circuit models. Involution delays, which are based on delay functions that are mathematical involutions depending on the previous-output-to-input time offset, were introduced by F\"ugger et al. [DATE'15] as a faithful alternative (that can easily be used with existing tools). Although involution delays were shown to predict real signal traces reasonably accurately, any model with a deterministic delay function is naturally limited in its modeling power. In this paper, we thus extend the involution model, by adding non-deterministic delay variations (random or even adversarial), and prove analytically that faithfulness is not impaired by this generalization. Albeit the amount of non-determinism must be considerably restricted to ensure this property, the result is surprising: the involution model differs from non-faithful models mainly in handling fast glitch trains, where small delay shifts have large effects. This originally suggested that adding even small variations should break the faithfulness of the model, which turned out not to be the case. Moreover, the results of our simulations also confirm that this generalized involution model has larger modeling power and, hence, applicability., Comment: 9 pages, 9 figures, extended version of a paper which was accepted at DATE'18

Causality is an important concept both for proving impossibility results and for synthesizing efficient protocols in distributed computing. For asynchronous agents communicating over unreliable channels, causality is well studied and understood. This understanding, however, relies heavily on the assumption that agents themselves are correct and reliable. We provide the first epistemic analysis of causality in the presence of byzantine agents, i.e., agents that can deviate from their protocol and, thus, cannot be relied upon. Using our new framework for epistemic reasoning in fault-tolerant multi-agent systems, we determine the byzantine analog of the causal cone and describe a communication structure, which we call a multipede, necessary for verifying preconditions for actions in this setting., Comment: In Proceedings TARK 2019, arXiv:1907.08335

We provide a complete characterization of both uniform and non-uniform deterministic consensus solvability in distributed systems with benign process and communication faults using point-set topology. More specifically, we non-trivially extend the approach introduced by Alpern and Schneider in 1985, by introducing novel fault-aware topologies on the space of infinite executions: the process-view topology, induced by a distance function that relies on the local view of a given process in an execution, and the minimum topology, which is induced by a distance function that focuses on the local view of the process that is the last to distinguish two executions. Consensus is solvable in a given model if and only if the sets of admissible executions leading to different decision values is disconnected in these topologies. By applying our approach to a wide range of different applications, we provide a topological explanation of a number of existing algorithms and impossibility results and develop several new ones, including a general equivalence of the strong and weak validity conditions.

We present a new technique for verifying nonlinear and hybrid models with inputs. We observe that once an input signal is fixed, the sensitivity analysis of the model can be computed much more precisely. Based on this result, we propose a new simulation-driven verification algorithm and apply it to a suite of nonlinear and hybrid models of CMOS digital circuits under different input signals. The models are low-dimensional but with highly nonlinear ODEs, with nearly hundreds of logarithmic and exponential terms. Some of our experiments analyze the metastability of bistable circuits with very sensitive ODEs and rigorously establish the connection between metastability recovery time and sensitivity., Comment: 8 pages, 8 figures, a shorter version will appear on the IFAC Conference on Analysis and Design of Hybrid Systems (ADHS 2018)

We report on the detection of free nanoparticles in a micromachined, open-access Fabry-P\'erot microcavity. With a mirror separation of $130\,\mu$m, a radius of curvature of $1.3\,$mm, and a beam waist of $12\,\mu$m, the mode volume of our symmetric infrared cavity is smaller than $15\,$pL. The small beam waist, together with a finesse exceeding 34,000, enables the detection of nano-scale dielectric particles in high vacuum. This device allows monitoring of the motion of individual $150\,$nm radius silica nanospheres in real time. We observe strong coupling between the particles and the cavity field, a precondition for optomechanical control. We discuss the prospects for optical cooling and detection of dielectric particles smaller than $10\,$nm in radius and $1\times10^7\,$amu in mass., Comment: 4 pages, 3 figures