Unbounded Orchestrations of Transducers for Manufacturing


  • Natasha Alechina Nottingham
  • Tomáš Brázdil Masaryk University
  • Giuseppe De Giacomo Sapienza Università di Roma
  • Paolo Felli Free University of Bolzano
  • Brian Logan Univ of Nottingham
  • Moshe Y. Vardi Rice University




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 multitransducers, the problem is undecidable.




How to Cite

Alechina, N., Brázdil, T., De Giacomo, G., Felli, P., Logan, B., & Vardi, M. Y. (2019). Unbounded Orchestrations of Transducers for Manufacturing. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 2646-2653. https://doi.org/10.1609/aaai.v33i01.33012646



AAAI Technical Track: Knowledge Representation and Reasoning