Yuhan Zhang
ABSTRACT
In industrial contexts, managing time and resources typically involves complex systems with various operational components. This paper introduces a state machine model, optimized for simulating multi-component collaborative processes in industry, which is based on the State Chart XML (SCXML) standard and referred to as SCXML automata. The execution of these automata is treated as Markov decision processes, providing a framework for optimization. The primary goal is to develop strategies ensuring safe operation of such automata while adhering to time and cost constraints. A detailed representation of these automata is presented, including grammar, semantics, and strategies, and methods for strategy generation are adapted from single to multi-component systems. The approach involves the analysis of simulation data from such automata using adaptive reinforcement learning techniques, leading to the generation of strategies that approach optimality. Results demonstrate the capability of this approach in finding near-optimal strategies within a specified number of iterations. This method holds significant research value in the field of industrial flexible production lines, offering a means to generate strategies for multi-layered automata, thereby enhancing process efficiency.
Supplemental Material
Available for Download
revised source files using the Primary Article Template to TAPS for processing
- Monireh Abdoos. 2020. A cooperative multiagent system for traffic signal control using game theory and reinforcement learning. IEEE Intelligent Transportation Systems Magazine 13, 4 (2020), 6–16.Google Scholar
Cross Ref
- Rajeev Alur and David L Dill. 1994. A theory of timed automata. Theoretical computer science 126, 2 (1994), 183–235.Google Scholar
- Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim G Larsen, Nicolas Markey, and Pierre-Alain Reynier. 2021. Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects of Computing 33 (2021), 3–25.Google ScholarDigital Library
- Jim Barnett. 2017. Introduction to SCXML. Multimodal Interaction with W3C Standards: Toward Natural User Interfaces to Everything (2017), 81–107.Google Scholar
- Gerd Behrmann, Agnes Cougnard, Alexandre David, Emmanuel Fleury, Kim G Larsen, and Didier Lime. 2007. UPPAAL-Tiga: Time for Playing Games! (Tool Paper). In Computer Aided Verification: 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007. Proceedings 19. Springer, 121–125.Google ScholarCross Ref
- Morten Bisgaard, David Gerhardt, Holger Hermanns, Jan Krčál, Gilles Nies, and Marvin Stenger. 2019. Battery-aware scheduling in low orbit: the GomX–3 case. Formal Aspects of Computing 31 (2019), 261–285.Google ScholarDigital Library
- Gregor V Bochmann, Martin Hilscher, Sven Linker, and Ernst-Rüdiger Olderog. 2017. Synthesizing and verifying controllers for multi-lane traffic maneuvers. Formal Aspects of Computing 29 (2017), 583–600.Google ScholarDigital Library
- Patricia Bouyer, Franck Cassez, Emmanuel Fleury, and Kim G Larsen. 2005. Synthesis of optimal strategies using HyTech. Electronic Notes in Theoretical Computer Science 119, 1 (2005), 11–31.Google ScholarDigital Library
- Patricia Bouyer, Kim G Larsen, Nicolas Markey, and Jacob Illum Rasmussen. 2006. Almost optimal strategies in one clock priced timed games. In International Conference on Foundations of Software Technology and Theoretical Computer Science. Springer, 345–356.Google ScholarDigital Library
- Thomas Brihaye, Véronique Bruyere, and Jean-François Raskin. 2005. On optimal timed strategies. In Formal Modeling and Analysis of Timed Systems: Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005. Proceedings 3. Springer, 49–64.Google ScholarDigital Library
- Apache Commons. 2005. SCXML-Commons SCXML. Available online: http://commons.apache.org/scxml/ (accessed on November 23, 2023).Google Scholar
- Alexandre David, Peter G Jensen, Kim Guldstrand Larsen, Axel Legay, Didier Lime, Mathias Grund Sørensen, and Jakob H Taankvist. 2014. On time with minimal expected cost!. In Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings 12. Springer, 129–145.Google ScholarCross Ref
- Chuchu Fan, Zengyi Qin, Umang Mathur, Qiang Ning, Sayan Mitra, and Mahesh Viswanathan. 2021. Controller synthesis for linear system with reach-avoid specifications. IEEE Trans. Automat. Control 67, 4 (2021), 1713–1727.Google ScholarCross Ref
- Xingshuo Hai, Zili Wang, Qiang Feng, Yi Ren, Bo Sun, and Dezhen Yang. 2021. A novel adaptive pigeon-inspired optimization algorithm based on evolutionary game theory. Science China Information Sciences 64 (2021), 1–2.Google ScholarCross Ref
- David Henriques, Joao G Martins, Paolo Zuliani, André Platzer, and Edmund M Clarke. 2012. Statistical model checking for Markov decision processes. In 2012 Ninth international conference on quantitative evaluation of systems. IEEE, 84–93.Google ScholarDigital Library
- Oded Maler, Amir Pnueli, and Joseph Sifakis. 1995. On the synthesis of discrete controllers for timed systems. In STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science Munich, Germany, March 2–4, 1995 Proceedings 12. Springer, 229–242.Google ScholarCross Ref
Index Terms
- An Optimization Approach for Automata Strategies in Industrial Simulation
Recommendations
Descriptional complexity of limited automata
A k-limited automaton is a linear bounded automaton that may rewrite each tape cell only in the first k visits, where k0 is a fixed constant. It is known that these automata accept context-free languages only. We investigate the descriptional complexity ...
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Cellular AutomataWe present simulation and separation results between multi-dimensional deterministic and alternating cellular automata (CAs). It is shown that for any integers k≥l≥1, every k-dimensional t(n)-time deterministic CA can be simulated by an l-dimensional O(...
Simulations between multi-dimensional deterministic and alternating cellular automata
Special issue on cellular automataWe present simulation and separation results between multi-dimensional deterministic and alternating cellular automata (CAs). It is shown that for any integers k ≥ l ≥ 1, every k-dimensional t(n)-time deterministic CA can be simulated by an l-...
Comments