RegularRepairofSpecications.PDFVIP

Regular Repair of Specifications Michael Benedikt Gabriele Puppis Cristian Riveros Oxford University Oxford University Oxford University michael.benedikt@comlab.ox.ac.uk gabriele.puppis@comlab.ox.ac.uk cristian.riveros@comlab.ox.ac.uk Abstract—What do you do if a computational object (e.g. a constraint that the input is guaranteed to satisfied – while program trace) fails a specification? An obvious approach is to is a target – a constraint that we want to enforce. We consider perform repair : modify the object minimally to get something the worst-case over a string of the number of edit that satisfies the constraints. In this paper we study repair of temporal constraints, given as automata or temporal logic operations needed to move into : . That formulas. We focus on determining the number of repairs that is, we look at the worst-case number of operations needed to must be applied to a word satisfying a given input constraint in get from to . Of course, this number may be infinite; the order to ensure that it satisfies a given target constraint. This core of our results is a procedure for solving the bounded number may well be unbounded; one of our main contributions repair problem – determining whether the supremum above is to isolate the complexity of the “bounded repair problem”, based on a characterization of the pairs of regular languages is finite. In order to compute this effectively, we need to that admit such a repair. We consider this in the setting where restrict the languages and . We consider this problem the repair strateg