References

  1. (2014): I2C-Bus Specification and User Manual. https://www.nxp.com/docs/en/user-guide/UM10204.pdf.
  2. (2014): ISO 11898-1:2015. Road vehicles —- Controller area network (CAN) — Part 1: Data link layer and physical signalling. https://www.iso.org/standard/63648.html.
  3. Martín Abadi, Leslie Lamport & Pierre Wolper (1989): Realizable and unrealizable specifications of reactive systems. In: International Colloquium on Automata, Languages, and Programming (ICALP'89). Springer, pp. 1–17, doi:10.1007/BFb0035748.
  4. Yehuda Afek, Hagit Attiya, Alan Fekete, Michael Fischer, Nancy Lynch, Yishay Mansour, Dai-Wei Wang & Lenore Zuck (1994): Reliable communication over unreliable channels. Journal of the ACM (JACM) 41(6), pp. 1267–1297, doi:10.1145/195613.195651.
  5. Alfred V. Aho, Aaron D. Wyner, Mihalis Yannakakis & Jeffrey D. Ullman (1982): Bounds on the size and transmission rate of communications protocols. Computers & Mathematics with Applications 8(3), pp. 205–214, doi:10.1016/0898-1221(82)90043-8.
  6. Eralp A. Akkoyunlu, Kattamuri Ekanadham & Richard V. Huber (1975): Some constraints and tradeoffs in the design of network communications. In: 5th ACM symposium on Operating Systems Principles, pp. 67–74, doi:10.1145/800213.806523.
  7. Keith A. Bartlett, Roger A. Scantlebury & Peter T. Wilkinson (1969): A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM (CACM) 12(5), pp. 260–261, doi:10.1145/362946.362970.
  8. Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer & Nathalie Sznajder (2020): Synthesis in Presence of Dynamic Links. HAL report hal-02917542. Available at https://hal.archives-ouvertes.fr/hal-02917542..
  9. Dietmar Berwanger, Anup Basil Mathew & Marie van den Bogaard (2018): Hierarchical information and the synthesis of distributed strategies. Acta Informatica 55(8), pp. 669–701, doi:10.1007/s00236-017-0306-5.
  10. J. Richard Büchi & Lawrence H. Landweber (1990): Solving sequential conditions by finite-state strategies. In: The Collected Works of J. Richard Büchi. Springer, pp. 525–541, doi:10.1007/978-1-4613-8928-6_29.
  11. Bernadette Charron-Bost, Matthias Függer & Thomas Nowak (2015): Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), pp. 528–539, doi:10.1007/978-3-662-47666-6_42.
  12. Bernadette Charron-Bost & André Schiper (2009): The heard-of model: computing in distributed systems with benign faults. Distributed Computing 22(1), pp. 49–71, doi:10.1007/s00446-009-0084-6.
  13. Alonzo Church (1957): Applications of recursive arithmetic to the problem of circuit synthesis – Summaries of talks. Institute for Symbolic Logic, Cornell University.
  14. Étienne Coulouma & Emmanuel Godard (2013): A Characterization of Dynamic Networks Where Consensus is Solvable. In: International Colloquium on Structural Information and Communication Complexity (SIROCCO'13). Springer, pp. 24–35, doi:10.1007/978-3-319-03578-9_3.
  15. Rayna Dimitrova & Bernd Finkbeiner (2009): Synthesis of fault-tolerant distributed systems. In: International Symposium on Automated Technology for Verification and Analysis (ATVA'09). Springer, pp. 321–336, doi:10.1007/978-3-642-04761-9_24.
  16. Ronald Fagin, Yoram Moses, Joseph Y Halpern & Moshe Y. Vardi (2003): Reasoning about knowledge. MIT press.
  17. Bernd Finkbeiner & Sven Schewe (2005): Uniform distributed synthesis. In: 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05). IEEE, pp. 321–330, doi:10.1109/LICS.2005.53.
  18. Paul Gastin, Benjamin Lerman & Marc Zeitoun (2004): Distributed games with causal memory are decidable for series-parallel systems. In: International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04). Springer, pp. 275–286, doi:10.1007/978-3-540-30538-5_23.
  19. Paul Gastin, Nathalie Sznajder & Marc Zeitoun (2009): Distributed synthesis for well-connected architectures. Formal Methods in System Design 34(3), pp. 215–237, doi:10.1007/s10703-008-0064-7.
  20. Blaise Genest, Hugo Gimbert, Anca Muscholl & Igor Walukiewicz (2013): Asynchronous Games over Tree Architectures. In: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, Lecture Notes in Computer Science 7966. Springer, pp. 275–286, doi:10.1007/978-3-642-39212-2_26.
  21. Hugo Gimbert (2018): On the Control of Asynchronous Automata. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), LIPIcs 93. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 30:1–30:15, doi:10.4230/LIPIcs.FSTTCS.2017.30.
  22. Nils Klarlund (1994): Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. Annals of Pure and Applied Logic 69(2-3), pp. 243–268, doi:10.1016/0168-0072(94)90086-8.
  23. Fabian Kuhn, Nancy Lynch & Rotem Oshman (2010): Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing (STOC'10), pp. 513–522, doi:10.1145/1806689.1806760.
  24. Orna Kupferman & Moshe Y. Vardi (1999): Church's problem revisited. Bulletin of Symbolic Logic 5(2), pp. 245–263, doi:10.2307/421091.
  25. Orna Kupferman & Moshe Y. Vardi (2000): Synthesis with incomplete information. In: Advances in Temporal Logic. Springer, pp. 109–127, doi:10.1007/978-94-015-9586-5_6.
  26. Orna Kupferman & Moshe Y. Vardi (2001): Synthesizing distributed systems. In: 16th Annual IEEE Symposium on Logic in Computer Science (LICS'01). IEEE, pp. 389–398, doi:10.1109/LICS.2001.932514.
  27. Leslie Lamport, Robert Shostak & Marshall Pease (1982): The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3), pp. 382–401, doi:10.1145/357172.357176.
  28. Nancy A. Lynch (1996): Distributed algorithms. Elsevier.
  29. P. Madhusudan, P.S. Thiagarajan & Shaofa Yang (2005): The MSO theory of connectedly communicating processes. In: International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05). Springer, pp. 201–212, doi:10.1007/11590156_16.
  30. Ron Van der Meyden & Thomas Wilke (2005): Synthesis of distributed systems from knowledge-based specifications. In: International Conference on Concurrency Theory (CONCUR'05). Springer, pp. 562–576, doi:10.1007/11539452_42.
  31. Ron Van der Meyden & Thomas Wilke (2005): Synthesis of distributed systems from knowledge-based specifications. UNSW-CSE-TR-0504. Technical Report. UNSW Sydney.
  32. Swarup Mohalik & Igor Walukiewicz (2003): Distributed games. In: International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03). Springer, pp. 338–351, doi:10.1007/978-3-540-24597-1_29.
  33. Gary L. Peterson & John H. Reif (1979): Multiple-person alternation. In: 20th Annual Symposium on Foundations of Computer Science (FOCS'79). IEEE, pp. 348–363, doi:10.1109/SFCS.1979.25.
  34. Amir Pnueli (1981): The temporal semantics of concurrent programs. Theoretical Computer Science 13(1), pp. 45–60, doi:10.1016/0304-3975(81)90110-9.
  35. Amir Pnueli & Roni Rosner (1988): A framework for the synthesis of reactive modules. In: International Conference on Concurrency (Concurrency 88). Springer, pp. 4–17, doi:10.1007/3-540-50403-6_28.
  36. Amir Pnueli & Roni Rosner (1989): On the synthesis of a reactive module. In: 16th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages (POPL'89), pp. 179–190, doi:10.1145/75277.75293.
  37. Amir Pnueli & Roni Rosner (1990): Distributed reactive systems are hard to synthesize. In: 31st Annual Symposium on Foundations of Computer Science (FoCS'90). IEEE, pp. 746–757, doi:10.1109/FSCS.1990.89597.
  38. Michael O. Rabin (1972): Automata on infinite objects and Church's problem 13. American Mathematical Soc., doi:10.1090/cbms/013.
  39. Shmuel Safra (1988): On the Complexity of ω-Automata. In: 29th Annual Symposium on Foundations of Computer Science (FoCS'88). IEEE Computer Society, pp. 319–327, doi:10.1109/SFCS.1988.21948.
  40. Wolfgang Thomas (1990): Automata on Infinite Objects. In: Jan van Leeuwen: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier and MIT Press, pp. 133–191, doi:10.1016/B978-0-444-88074-1.50009-3.
  41. Wolfgang Thomas (1995): On the synthesis of strategies in infinite games. In: Annual Symposium on Theoretical Aspects of Computer Science (STACS'95). Springer, pp. 1–13, doi:10.1007/3-540-59042-0_57.
  42. Moshe Y. Vardi & Pierre Wolper (1994): Reasoning About Infinite Computations. Information and Computation 115(1), pp. 1–37, doi:10.1006/inco.1994.1092.
  43. Yaron Velner & Alexander Rabinovich (2011): Church synthesis problem for noisy input. In: International Conference on Foundations of Software Science and Computational Structures (FoSSaCS'11). Springer, pp. 275–289, doi:10.1007/978-3-642-19805-2_19.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org