References

  1. Raven Beutner, Bernd Finkbeiner & Jesko Hecking-Harbusch (2019): Translating Asynchronous Games for Distributed Synthesis. In: Wan J. Fokkink & Rob van Glabbeek: 30th International Conference on Concurrency Theory, CONCUR 2019, LIPIcs 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 26:1–26:16, doi:10.4230/LIPIcs.CONCUR.2019.26.
  2. Roderick Bloem, Sven Schewe & Ayrat Khalimov (2017): CTL* synthesis via LTL synthesis. In: Dana Fisman & Swen Jacobs: Proceedings Sixth Workshop on Synthesis, SYNT@CAV 2017, EPTCS 260, pp. 4–22, doi:10.4204/EPTCS.260.4.
  3. Alonzo Church (1957): Applications of recursive arithmetic to the problem of circuit synthesis. Summaries of the Summer Institute of Symbolic Logic 1, pp. 3–50.
  4. Joost Engelfriet (1991): Branching Processes of Petri Nets. Acta Inf. 28(6), pp. 575–591, doi:10.1007/BF01463946.
  5. Javier Esparza, Stefan Römer & Walter Vogler (2002): An Improvement of McMillan's Unfolding Algorithm. Formal Methods Syst. Des. 20(3), pp. 285–310, doi:10.1023/A:1014746130920.
  6. Bernd Finkbeiner (2015): Bounded Synthesis for Petri Games. In: Roland Meyer, André Platzer & Heike Wehrheim: Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Proceedings, Lecture Notes in Computer Science 9360. Springer, pp. 223–237, doi:10.1007/978-3-319-23506-6_15.
  7. Bernd Finkbeiner & Paul Gölz (2018): Synthesis in Distributed Environments. In: Satya Lokam & R. Ramanujam: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017), Leibniz International Proceedings in Informatics (LIPIcs) 93. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 28:1–28:14, doi:10.4230/LIPIcs.FSTTCS.2017.28.
  8. Bernd Finkbeiner & Ernst-Rüdiger Olderog (2017): Petri games: Synthesis of distributed systems with causal memory. Information and Computation 253, pp. 181–203, doi:10.1016/j.ic.2016.07.006. GandALF 2014.
  9. Bernd Finkbeiner & Sven Schewe (2005): Uniform Distributed Synthesis. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), Proceedings, pp. 321–330, doi:10.1109/LICS.2005.53.
  10. Blaise Genest, Hugo Gimbert, Anca Muscholl & Igor Walukiewicz (2013): Asynchronous Games over Tree Architectures. In: Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska & David Peleg: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings, Part II, Lecture Notes in Computer Science 7966. Springer, pp. 275–286, doi:10.1007/978-3-642-39212-2_26.
  11. Hugo Gimbert (2017): On the Control of Asynchronous Automata. In: Satya V. Lokam & R. Ramanujam: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, India, LIPIcs 93. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 30:1–30:15, doi:10.4230/LIPIcs.FSTTCS.2017.30.
  12. Hugo Gimbert (2022): Distributed Asynchronous Games With Causal Memory are Undecidable. Log. Methods Comput. Sci. 18(3), doi:10.46298/lmcs-18(3:30)2022.
  13. Paul Hannibal & Ernst-Rüdiger Olderog (2022): The Synthesis Problem for Repeatedly Communicating Petri Games. In: Luca Bernardinello & Laure Petrucci: Application and Theory of Petri Nets and Concurrency - 43rd International Conference, PETRI NETS 2022, Proceedings, Lecture Notes in Computer Science 13288. Springer, pp. 236–257, doi:10.1007/978-3-031-06653-5_13.
  14. O. Kupferman & M.Y. Vardi (2001): Synthesizing distributed systems. Proceedings - Symposium on Logic in Computer Science, pp. 389–398, doi:10.1109/LICS.2001.932514.
  15. P. Madhusudan & P. S. Thiagarajan (2002): A Decidable Class of Asynchronous Distributed Controllers. In: Lubos Brim, Petr Jancar, Mojmír Kretínský & Antonín Kucera: CONCUR 2002 - Concurrency Theory, 13th International Conference, Proceedings, Lecture Notes in Computer Science 2421. Springer, pp. 145–160, doi:10.1007/3-540-45694-5_11.
  16. P. Madhusudan, P. S. Thiagarajan & Shaofa Yang (2005): The MSO Theory of Connectedly Communicating Processes. In: Ramaswamy Ramanujam & Sandeep Sen: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Proceedings, Lecture Notes in Computer Science 3821. Springer, pp. 201–212, doi:10.1007/11590156_16.
  17. Anca Muscholl (2015): Automated Synthesis of Distributed Controllers. In: Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi & Bettina Speckmann: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings, Part II, Lecture Notes in Computer Science 9135. Springer, pp. 11–27, doi:10.1007/978-3-662-47666-6_2.
  18. Amir Pnueli & Roni Rosner (1989): On the Synthesis of an Asynchronous Reactive Module. In: Giorgio Ausiello, Mariangiola Dezani-Ciancaglini & Simona Ronchi Della Rocca: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Proceedings, Lecture Notes in Computer Science 372. Springer, pp. 652–671, doi:10.1007/BFb0035790.
  19. Amir Pnueli & Roni Rosner (1990): Distributed Reactive Systems Are Hard to Synthesize. In: 31st Annual Symposium on Foundations of Computer Science, Volume II, pp. 746–757, doi:10.1109/FSCS.1990.89597.
  20. R. Rosner (1992): Modular synthesis of reactive systems. Weizmann Institute of Science, Rehovot, Israel.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org