Learn More
—The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of(More)
— We consider the problem of collision avoidance at road intersections in vehicular networks in the presence of uncontrolled vehicles, a disturbance, and measurement uncertainty. Our goal is to construct a supervisor of the continuous time system that is safe (i.e., avoids collisions), non-blocking (i.e., all vehicles eventually cross the intersection), and(More)
—We consider the problem of collision avoidance at vehicular intersections for a set of controlled and uncontrolled vehicles that are linked by wireless communication. Each vehicle is modeled by a first order system. We use a disturbance to account for bounded model uncertainty. We construct a discrete event system abstraction and formulate the problem in(More)
—This paper considers the problem of finding dynamic sensor activation policies that satisfy the property of K-diagnosability for discrete event systems modeled by finite state automata. We begin by choosing a suitable information state for the problem and defining a controller. We then define a structure called the most permissive observer, which provides(More)
This paper considers the problem of dynamic sensor selection under the constraint of maintaining the property of K-diagnosability. We use an information-state-based approach to define the most permissive observer, a structure introduced in prior work that provides all feasible solutions for the controller (i.e., for sensor selections). The principal result(More)
— We consider a network formation game where a finite number of nodes wish to send traffic to each other. Nodes contract bilaterally with each other to form communication links; once the network is formed, traffic is routed along shortest paths (if possible). Cost is incurred to a node from four sources: (1) routing traffic; (2) maintaining links to other(More)