Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
Transactional events (TE) are an extension of Concurrent ML (CML), a programming model for synchronous message-passing. Prior work has focused on TE's formal semantics and it...
Matthew Kehrt, Laura Effinger-Dean, Michael Schmit...
It has been established recently that, under mild conditions, deterministic long run average problems of optimal control are "asymptotically equivalent" to infinite-dimen...
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...