Document Open Access Logo

On the Control of Asynchronous Automata

Author Hugo Gimbert

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2017.30.pdf
  • Filesize: 0.55 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • Asynchronous automata
  • Controller synthesis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The decidability of the distributed version of the Ramadge and Wonham controller synthesis problem,
where both the plant and the controllers are modeled as asynchronous automata
and the controllers have causal memory
is a challenging open problem.
There exist three classes of plants for which the existence of a correct controller with causal memory has been shown decidable: when the dependency graph of actions is series-parallel, 
when the processes are connectedly communicating and when the dependency graph of processes is a tree. 
We design a class of plants, called decomposable games, 
with a decidable controller synthesis problem.
This provides
 a unified proof of the three existing decidability results
 as well as new examples of decidable plants.

Cite As Get BibTex

Hugo Gimbert. On the Control of Asynchronous Automata. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.FSTTCS.2017.30

Author Details

Hugo Gimbert

References

  1. Volker Diekert and Grzegorz Rozenberg. The Book of Traces. World Scientific, 1995. URL: https://books.google.co.uk/books?id=vNFLOE2pjuAC.
  2. Bernd Finkbeiner and Sven Schewe. Uniform distributed synthesis. In Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on, pages 321-330. IEEE, 2005. Google Scholar
  3. Paul Gastin, Benjamin Lerman, and Marc Zeitoun. Distributed games with causal memory are decidable for series-parallel systems. In Kamal Lodaya and Meena Mahajan, editors, FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, volume 3328 of Lecture Notes in Computer Science, pages 275-286. Springer, 2004. URL: http://dx.doi.org/10.1007/978-3-540-30538-5_23.
  4. Blaise Genest, Hugo Gimbert, Anca Muscholl, and Igor Walukiewicz. Asynchronous games over tree architectures. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 275-286. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-39212-2_26.
  5. Hugo Gimbert. A class of zielonka automata with a decidable controller synthesis problem. CoRR, abs/1601.05176, 2016. URL: http://arxiv.org/abs/1601.05176.
  6. P. Madhusudan, P. S. Thiagarajan, and Shaofa Yang. The MSO theory of connectedly communicating processes. In Ramaswamy Ramanujam and Sandeep Sen, editors, FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, volume 3821 of Lecture Notes in Computer Science, pages 201-212. Springer, 2005. URL: http://dx.doi.org/10.1007/11590156_16.
  7. Anca Muscholl. Automated synthesis of distributed controllers. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, volume 9135 of Lecture Notes in Computer Science, pages 11-27. Springer, 2015. URL: http://dx.doi.org/10.1007/978-3-662-47666-6_2.
  8. Anca Muscholl and Igor Walukiewicz. Distributed synthesis for acyclic architectures. In Venkatesh Raman and S. P. Suresh, editors, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, volume 29 of LIPIcs, pages 639-651. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. URL: http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.639.
  9. Anca Muscholl, Igor Walukiewicz, and Marc Zeitoun. A look at the control of asynchronous automata. In M. Mukund K. Lodaya and eds. N. Kumar, editors, Perspectives in Concurrency Theory. Universities Press, CRC Press, 2009. Google Scholar
  10. Amir Pnueli and Roni Rosner. Distributed reactive systems are hard to synthesize. In Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on, pages 746-757. IEEE, 1990. Google Scholar
  11. Peter JG Ramadge and W Murray Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(1):81-98, 1989. Google Scholar
  12. Wieslaw Zielonka. Notes on finite asynchronous automata. ITA, 21(2):99-135, 1987. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact