Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Abstract— A novel nonparametric paradigm to model identification has been recently proposed where, in place of postulating finite-dimensional models of the system transfer func...
Gianluigi Pillonetto, Alessandro Chiuso, Giuseppe ...
Abstract: Designing and managing dependable systems is a difficult endeavor. In this paper, we describe challenges in this vast problem space, including provisioning and allocatin...
Kimberly Keeton, Dirk Beyer 0002, Jeffrey S. Chase...
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...