8 citations · 43 across the 13 of their papers we have counts for
13 papers
Modal Reactors
Alexander Schulz-Rosengarten, Reinhard von Hanxleden, Marten Lohstroh +2
Complex software systems often feature distinct modes of operation, each designed to handle a particular scenario that may require the system to respond in a certain way. Breaking…
Consistency vs. Availability in Distributed Real-Time Systems
Edward A. Lee, Ravi Akella, Soroush Bateni +3
In distributed applications, Brewer's CAP theorem tells us that when networks become partitioned (P), one must give up either consistency (C) or availability (A). Consistency is ag…
High-Performance Deterministic Concurrency using Lingua Franca
Christian Menard, Marten Lohstroh, Soroush Bateni +10
Actor frameworks and similar reactive programming techniques are widely used for building concurrent systems. They promise to be efficient and scale well to a large number of cores…
Xronos: Predictable Coordination for Safety-Critical Distributed Embedded Systems
Soroush Bateni, Marten Lohstroh, Hou Seng Wong +6
Asynchronous frameworks for distributed embedded systems, like ROS and MQTT, are increasingly used in safety-critical applications such as autonomous driving, where the cost of uni…
Blind source separation of baseband RF communication signals using mixed-signal matrix multiplication circuit
Bindu Madhavan, Edward Lee, Joshua Zusman +1
An 8 x 8 mixed-signal matrix multiplier architecture based on 64 hybrid capacitor-resistor multiplying digital to analogue converters implemented in a 65 nm CMOS technology was dev…
Quantifying and Generalizing the CAP Theorem
Edward A. Lee, Soroush Bateni, Shaokai Lin +2
In distributed applications, Brewer's CAP theorem tells us that when networks become partitioned, there is a tradeoff between consistency and availability. Consistency is agreement…
Learning Branching Heuristics for Propositional Model Counting
Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu +4
Propositional model counting, or #SAT, is the problem of computing the number of satisfying assignments of a Boolean formula. Many problems from different application areas, includ…
A Metric for Linear Temporal Logic
Íñigo Íncer Romeo, Marten Lohstroh, Antonio Iannopollo +2
We propose a measure and a metric on the sets of infinite traces generated by a set of atomic propositions. To compute these quantities, we first map properties to subsets of the r…
Learning Heuristics for Quantified Boolean Formulas through Deep Reinforcement Learning
Gil Lederman, Markus N. Rabe, Edward A. Lee +1
We demonstrate how to learn efficient heuristics for automated reasoning algorithms for quantified Boolean formulas through deep reinforcement learning. We focus on a backtracking…
Analysis and Design of a Passive Switched-Capacitor Matrix Multiplier for Approximate Computing
Edward H. Lee, S. Simon Wong
A switched-capacitor matrix multiplier is presented for approximate computing and machine learning applications. The multiply-and-accumulate operations perform discrete-time charge…
Control Improvisation with Probabilistic Temporal Specifications
Ilge Akkaya, Daniel J. Fremont, Rafael Valle +3
We consider the problem of generating randomized control sequences for complex networked systems typically actuated by human agents. Our approach leverages a concept known as contr…
The Fixed-Point Theory of Strictly Contracting Functions on Generalized Ultrametric Semilattices
Eleftherios Matsikoudis, Edward A. Lee
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized…
Numerical LTL Synthesis for Cyber-Physical Systems
Chih-Hong Cheng, Edward A. Lee
Cyber-physical systems (CPS) are systems that interact with the physical world via sensors and actuators. In such a system, the reading of a sensor represents measures of a physica…