6 research outputs found
Traffic Network Control from Temporal Logic Specifications
We propose a framework for generating a signal control policy for a traffic
network of signalized intersections to accomplish control objectives
expressible using linear temporal logic. By applying techniques from model
checking and formal methods, we obtain a correct-by-construction controller
that is guaranteed to satisfy complex specifications. To apply these tools, we
identify and exploit structural properties particular to traffic networks that
allow for efficient computation of a finite state abstraction. In particular,
traffic networks exhibit a componentwise monotonicity property which allows
reach set computations that scale linearly with the dimension of the continuous
state space
On synthesizing robust discrete controllers under modeling uncertainty
We investigate the robustness of reactive control protocols
synthesized to guarantee system's correctness with respect
to given temporal logic specifications. We consider uncertainties in open finite transition systems due to unmodeled transitions. The resulting robust synthesis problem is formulated as a temporal logic game. In particular, if the specification is in the so-called generalized reactivity [1] fragment of linear temporal logic, so is the augmented specification in the resulting robust synthesis problem. Hence, the robust synthesis problem belongs to the same complexity class with the nominal synthesis problem, and is amenable to polynomial
time solvers. Additionally, we discuss reasoning about
the effects of different levels of uncertainties on robust synthesizability and demonstrate the results on a simple robot motion planning scenario