Qualitative approximate behavior composition

From MaRDI portal
Publication:2915091

DOI10.1007/978-3-642-33353-8_35zbMATH Open1361.68282arXiv1207.3863OpenAlexW2117853997MaRDI QIDQ2915091FDOQ2915091


Authors: Sebastian Sardiña, Nitin Kumar Yadav Edit this on Wikidata


Publication date: 21 September 2012

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1207.3863




Recommendations



Cites Work


Cited In (3)

Uses Software





This page was built for publication: Qualitative approximate behavior composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915091)