Unbounded Orchestrations of Transducers for Manufacturing

D 2019

Unbounded Orchestrations of Transducers for Manufacturing

ALECHINA, Natasha, Tomáš BRÁZDIL, Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN et. al.

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

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

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

DOI

http://dx.doi.org/10.1609/aaai.v33i01.33012646

UT WoS

000485292602081

Keywords in English

manufacturing processes modeling; orchestration

Abstract

V originále

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 project

Name: Algoritmy pro diskrétní systémy a hry s nekonečně mnoha stavy

Investor: Czech Science Foundation

Citovat

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.

@inproceedings{1654881,
   author = {Alechina, Natasha and Brázdil, Tomáš and De Giacomo, Giuseppe and Felli, Paolo and Logan, Brian and Vardi, Moshe},
   address = {Palo Alto},
   booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
   doi = {http://dx.doi.org/10.1609/aaai.v33i01.33012646},
   keywords = {manufacturing processes modeling; orchestration},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Palo Alto},
   isbn = {978-1-57735-809-1},
   pages = {2646-2653},
   publisher = {AAAI},
   title = {Unbounded Orchestrations of Transducers for Manufacturing},
   year = {2019}
}

TY  - JOUR
ID  - 1654881
AU  - Alechina, Natasha - Brázdil, Tomáš - De Giacomo, Giuseppe - Felli, Paolo - Logan, Brian - Vardi, Moshe
PY  - 2019
TI  - Unbounded Orchestrations of Transducers for Manufacturing
PB  - AAAI
CY  - Palo Alto
SN  - 9781577358091
KW  - manufacturing processes modeling
KW  - orchestration
N2  - 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.
ER  -

ALECHINA, Natasha, Tomáš BRÁZDIL, Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN and Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In \textit{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.

Detailed Information on Publication Record