Qualitative Approximate Behavior Composition

07/17/2012
by   Nitin Yadav, et al.
0

The behavior composition problem involves automatically building a controller that is able to realize a desired, but unavailable, target system (e.g., a house surveillance) by suitably coordinating a set of available components (e.g., video cameras, blinds, lamps, a vacuum cleaner, phones, etc.) Previous work has almost exclusively aimed at bringing about the desired component in its totality, which is highly unsatisfactory for unsolvable problems. In this work, we develop an approach for approximate behavior composition without departing from the classical setting, thus making the problem applicable to a much wider range of cases. Based on the notion of simulation, we characterize what a maximal controller and the "closest" implementable target module (optimal approximation) are, and show how these can be computed using ATL model checking technology for a special case. We show the uniqueness of optimal approximations, and prove their soundness and completeness with respect to their imported controllers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2023

Improving the performance of Learned Controllers in Behavior Trees using Value Function Estimates at Switching Boundaries

Behavior trees represent a modular way to create an overall controller f...
research
09/07/2017

On the Complexity of ATL and ATL* Module Checking

Module checking has been introduced in late 1990s to verify open systems...
research
08/23/2018

SOTER: Programming Safe Robotics System using Runtime Assurance

Autonomous robots increasingly depend on third-party off-the-shelf compo...
research
02/24/2021

A CP-Net based Qualitative Composition Approach for an IaaS Provider

We propose a novel CP-Net based composition approach to qualitatively se...
research
11/29/2017

A Class of Control Certificates to Ensure Reach-While-Stay for Switched Systems

In this article, we consider the problem of synthesizing switching contr...
research
02/28/2021

"ReLIC: Reduced Logic Inference for Composition" for Quantifier Elimination based Compositional Reasoning and Verification

The paper presents our research on quantifier elimination (QE) for compo...
research
09/07/2017

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

In this paper, we investigate the model checking (MC) problem for Halper...

Please sign up or login with your details

Forgot password? Click here to reset