Minimal specification revision for weighted transition systems

Kangjin Kim, Georgios Fainekos
2013 2013 IEEE International Conference on Robotics and Automation  
In this paper, we study the problem of revising Linear Temporal Logic (LTL) formulas that capture specifications for optimal planning over weighted transition systems. Namely, it is assumed that the model of the system is a weighted finite state transition system. The LTL specification captures the system requirements which must be satisfied by a plan which costs less than a certain cost budget. If the cost bounds cannot be satisfied with the initial specification, then it is desirable to
more » ... to the user a specification that can be satisfied on the system within the desired cost budget. We prove that the specification revision problem for automatabased optimal planning is NP-complete. In order to provide exact solutions to the problem, we present an Integer Linear Program (ILP) and a Mixed-Integer Linear Program (MILP) formulation for different versions of the problem. Finally, we indicate that a Linear Program (LP) relaxation can compute fast approximations to the problem.
doi:10.1109/icra.2013.6631151 dblp:conf/icra/KimF13 fatcat:yadrbjo5l5cjvi3juqau3tecry