Goto

Collaborating Authors

 automatic synthesis


Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems

Brorholt, Asger Horn, Høeg-Petersen, Andreas Holck, Jensen, Peter Gjøl, Larsen, Kim Guldstrand, Mikučionis, Marius, Schilling, Christian, Wąsowski, Andrzej

arXiv.org Artificial Intelligence

We present Uppaal Coshy, a tool for automatic synthesis of a safety strategy -- or shield -- for Markov decision processes over continuous state spaces and complex hybrid dynamics. The general methodology is to partition the state space and then solve a two-player safety game, which entails a number of algorithmically hard problems such as reachability for hybrid systems. The general philosophy of Uppaal Coshy is to approximate hard-to-obtain solutions using simulations. Our implementation is fully automatic and supports the expressive formalism of Uppaal models, which encompass stochastic hybrid automata. The precision of our partition-based approach benefits from using finer grids, which however are not efficient to store. We include an algorithm called Caap to efficiently compute a compact representation of a shield in the form of a decision tree, which yields significant reductions.



PrePrint: Automatic Synthesis of Regular Expressions from Examples

IEEE Computer

We propose a system for the automatic generation of regular expressions for text-extraction tasks. The user describes the desired task only by means of a set of labeled examples. The generated regexes may be used with common engines such as those that are part of Java, PHP, Perl and so on. Usage of the system does not require any familiarity with regular expressions syntax. We performed an extensive experimental evaluation on 12 different extraction tasks applied to real-world datasets.



Automatic synthesis of fine-motion strategies for robots

Lozano-Perez, T. | Mason, M. | Taylor, R.

Classics

Active compliance enables robots to carry out tasks in the presence of significant sensing and control errors. Compliant motions are quite difficult for humans to specify, however. Furthermore, robot programs are quite sensitive to details of geometry and to error characteristics and must, therefore, be constructed anew for each task. These factors motivate the search for automatic synthesis tools for robot program ming, especially for compliant motion. This paper describes a formal approach to the synthesis of compliant-motion strategies from geometric descriptions of assembly operations and explicit estimates of errors in sensing and control.