A Logic Approach for LTL System Modification

Ding, Yulin; Zhang, Yan

doi:10.1007/11425274_45

Cited by 11 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For one, the user does not know where to position the placeholders in the formula when the planning fails. Ding and Zhang (2005) and Finger and Wassermann (2008) also present a related problem. It is the problem of revising a system model such that it satisfies a temporal logic specification.…”

Section: Related Workmentioning

confidence: 99%

On the minimal revision problem of specification automata

Kim

Fainekos

Sankaranarayanan

2015

The International Journal of Robotics Research

View full text Add to dashboard Cite

As robots are being integrated into our daily lives, it becomes necessary to provide guarantees on their safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as ''close'' as possible to the initial user intent. This paper establishes that the latter problem, which is referred to as the minimal specification revision problem, is NP-complete. A heuristic algorithm is presented that can compute good approximations to the Minimal Revision Problem (MRP) in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.

show abstract

Section: Related Workmentioning

confidence: 99%

On the minimal revision problem of specification automata

Kim

Fainekos

Sankaranarayanan

2015

The International Journal of Robotics Research

View full text Add to dashboard Cite

show abstract

“…Ding and Zhang defined the basic repair steps of Kripke model for specifications in LTL (linear-time temporal logic) [6]. To formalize the concept of repair cost, they defined the ordering among repairs and presented theorems in characterizing the minimum repairs for specifications like F ψ and ψ 1 ∧ ψ 2 .…”

Section: Related Workmentioning

confidence: 99%

“…We first formalize the concept of repairs to state graphs. As in [3,6,7], we may define a repair of a model state graph as a sequence of graph-edit operations that transforms the graph to one that is bisimulation equivalent to a specification. In a repair, we allow the following four types of basic edit operations.…”

Section: Repairs and Their Cost Estimationmentioning

confidence: 99%

Program Repair Suggestions from Graphical State-Transition Specifications

Wang

Cheng

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

View full text Add to dashboard Cite

Abstract. In software engineering, graphical formalisms, like statetransition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads to specification refinement that maintains the simulation/bisimulation relation between an implementation and a specification. We investigate how to use formal techniques to generate suggestions for repairing a program that breaks the bisimulation relation with a graphical specification. We use state graphs as a unified representation of the program models and specifications. We propose a technique that may evaluate the cost of a repair. We present a PTIME heuristic algorithm that suggests how to repair a model state graph. We then explain how to derive repair suggestions for programs from the repair for state graphs. Finally, we report our experiment that checks the performance of our repair algorithms and the costs of our repairs.

show abstract

“…The first option is to keep the desired specification while considering a new model which should satisfy it and remain as close as possible to the initial model (Ding and Zhang, 2005). A subset of these methods is based on the notion of abstraction refinement.…”

Section: Introductionmentioning

confidence: 99%

Abstraction refinement and plan revision for control synthesis under high level specifications

Meyer

Dimarogonas

2017

IFAC-PapersOnLine

View full text Add to dashboard Cite

This paper presents a novel framework combining abstraction refinement and plan revision for control synthesis problems under temporal logic specifications. The control problem is first solved on a simpler nominal model in order to obtain a satisfying plan to be followed by the real system. A controller synthesis is then attempted for an abstraction of the real system to follow this plan. Upon failure of this synthesis, cost functions are defined to guide towards either refining the initially coarse partition to obtain a finer abstraction, or looking for an alternative plan using the nominal model as above. This tentative synthesis is then repeated until a plan and an abstraction of the real system able to follow this plan are found. The obtained controller also ensures that the real system satisfies the initial specification. A numerical example is provided to illustrate this framework.

show abstract

A Logic Approach for LTL System Modification

Cited by 11 publications

References 10 publications

On the minimal revision problem of specification automata

On the minimal revision problem of specification automata

Program Repair Suggestions from Graphical State-Transition Specifications

Abstraction refinement and plan revision for control synthesis under high level specifications

Contact Info

Product

Resources

About