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.

Základní údaje

Originální název

Unbounded Orchestrations of Transducers for Manufacturing

Autoři

ALECHINA, Natasha; Tomáš BRÁZDIL; Giuseppe DE GIACOMO; Paolo FELLI; Brian LOGAN a Moshe VARDI

Vydání

Palo Alto, Proceedings of the AAAI Conference on Artificial Intelligence, od s. 2646-2653, 8 s. 2019

Nakladatel

AAAI

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

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

Forma vydání

tištěná verze "print"

Kód RIV

RIV/00216224:14330/19:00113879

Organizační jednotka

Fakulta informatiky

ISBN

978-1-57735-809-1

ISSN

DOI

https://doi.org/10.1609/aaai.v33i01.33012646

UT WoS

000485292602081

EID Scopus

2-s2.0-85090803559

Klíčová slova anglicky

manufacturing processes modeling; orchestration

Štítky

core_A, firank_1

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 15. 5. 2024 01:15, RNDr. Pavel Šmerk, Ph.D.

Anotace

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.

Návaznosti

GA18-11193S, projekt VaV

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

Investor: Grantová agentura ČR, Algoritmy pro diskrétní systémy a hry s nekonečně mnoha stavy

Citovat

ALECHINA, Natasha; Tomáš BRÁZDIL; Giuseppe DE GIACOMO; Paolo FELLI; Brian LOGAN a Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI, 2019, s. 2646-2653. ISBN 978-1-57735-809-1. Dostupné z: https://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 = {https://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  - CONF
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 a Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In \textit{Proceedings of the AAAI Conference on Artificial Intelligence}. Palo Alto: AAAI, 2019, s.~2646-2653. ISBN~978-1-57735-809-1. Dostupné z: https://doi.org/10.1609/aaai.v33i01.33012646.

Přehled o publikaci