ALECHINA, Natasha, Tomáš BRÁZDIL, Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN and Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI, 2019, p. 2646-2653. ISBN 978-1-57735-809-1. Available from: https://dx.doi.org/10.1609/aaai.v33i01.33012646.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Unbounded Orchestrations of Transducers for Manufacturing
Authors ALECHINA, Natasha, Tomáš BRÁZDIL (203 Czech Republic, belonging to the institution), Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN and Moshe VARDI.
Edition Palo Alto, Proceedings of the AAAI Conference on Artificial Intelligence, p. 2646-2653, 8 pp. 2019.
Publisher AAAI
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/19:00113879
Organization unit Faculty of Informatics
ISBN 978-1-57735-809-1
ISSN 2159-5399
Doi http://dx.doi.org/10.1609/aaai.v33i01.33012646
UT WoS 000485292602081
Keywords in English manufacturing processes modeling; orchestration
Tags core_A, firank_1
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 15/5/2024 01:15.
Abstract
There has recently been increasing interest in using reactive synthesis techniques to automate the production of manufacturing process plans. Previous work has assumed that the set of manufacturing resources is known and fixed in advance. In this paper, we consider the more general problem of whether a controller can be synthesized given sufficient resources. In the unbounded setting, only the types of available manufacturing resources are given, and we want to know whether it is possible to manufacture a product using only resources of those type(s), and, if so, how many resources of each type are needed. We model manufacturing processes and facilities as transducers (automata with output), and show that the unbounded orchestration problem is decidable and the (Pareto) optimal set of resources necessary to manufacture a product is computable for uni-transducers. However, for multi-transducers, the problem is undecidable.
Links
GA18-11193S, research and development projectName: Algoritmy pro diskrétní systémy a hry s nekonečně mnoha stavy
Investor: Czech Science Foundation
PrintDisplayed: 19/9/2024 01:29