References

  1. Dietmar Berwanger (2007): Admissibility in Infinite Games. In: Wolfgang Thomas & Pascal Weil: STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 188–199, doi:10.1007/978-3-540-70918-3_17.
  2. Romain Brenguier, Jean-François Raskin & Ocan Sankur (2015): Assume-Admissible Synthesis. In: 26th International Conference on Concurrency Theory (CONCUR 2015), LIPIcs 42. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 100–113, doi:10.4230/LIPIcs.CONCUR.2015.100. Available at http://arxiv.org/abs/1507.00623.
  3. J. Richard Büchi & Lawrence H. Landweber (1990): Solving Sequential Conditions by Finite-State Strategies. In: Saunders Mac Lane & Dirk Siefkes: The Collected Works of J. Richard Büchi. Springer New York, pp. 525–541, doi:10.1007/978-1-4613-8928-6_29.
  4. Krishnendu Chatterjee & Thomas A. Henzinger (2007): Assume-Guarantee Synthesis. In: Tiziana Margaria & Wang Yi: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 4424. Springer Berlin Heidelberg, pp. 261–275, doi:10.1007/978-3-540-71209-1_21.
  5. Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2008): Environment Assumptions for Synthesis. In: CONCUR 2008 - Concurrency Theory: 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, Lecture Notes in Computer Science 5201. Springer Berlin Heidelberg, pp. 147–161, doi:10.1007/978-3-540-85361-9_14.
  6. Alonzo Church (1963): Logic, Arithmetic and Automata. In: Proc. 1962 Intl. Congr. Math., pp. 23–25, doi:10.2307/2270398.
  7. Samuel Coogan & M. Arcak (2014): Freeway traffic control from linear temporal logic specifications. In: Cyber-Physical Systems (ICCPS), 2014 ACM/IEEE International Conference on, pp. 36–47, doi:10.1109/ICCPS.2014.6843709.
  8. Werner Damm, Stefan Disch, Hardi Hungar, Swen Jacobs, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann & Boris Wirtz (2007): Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space. In: Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino & Yoshio Okamura: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Lecture Notes in Computer Science 4762. Springer, pp. 425–440, doi:10.1007/978-3-540-75596-8_30.
  9. Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann & Boris Wirtz (2006): Automatic verification of hybrid systems with large discrete state space. In: Susanne Graf & Wenhui Zhang: Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis, Lecture Notes in Computer Science 4218. Springer-Verlag, pp. 276–291, doi:10.1007/11901914_22.
  10. Werner Damm & Bernd Finkbeiner (2011): Does It Pay to Extend the Perimeter of a World Model?. In: Michael Butler & Wolfram Schulte: FM 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings, Lecture Notes in Computer Science 6664. Springer Berlin Heidelberg, pp. 12–26, doi:10.1007/978-3-642-21437-0_4.
  11. Werner Damm & Bernd Finkbeiner (2014): Automatic Compositional Synthesis of Distributed Systems. In: Cliff Jones, Pekka Pihlajasaari & Jun Sun: FM 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings, Lecture Notes in Computer Science 8442. Springer International Publishing, pp. 179–193, doi:10.1007/978-3-319-06410-9_13.
  12. Werner Damm, Hans-Jörg Peter, Jan Rakow & Bernd Westphal (2013): Can we build it: formal synthesis of control strategies for cooperative driver assistance systems. Mathematical Structures in Computer Science 23, pp. 676–725, doi:10.1017/S0960129512000230.
  13. Werner Damm, Guilherme Pinto & Stefan Ratschan (2007): Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems. Int. Journal of Foundations of Computer Science 18(1), pp. 63–86, doi:10.1142/S0129054107004577.
  14. Tomáš Dzetkulič & Stefan Ratschan (2011): Incremental Computation of Succinct Abstractions for Hybrid Systems. In: Uli Fahrenberg & Stavros Tripakis: Formal Modeling and Analysis of Timed Systems, Lecture Notes in Computer Science 6919. Springer Berlin Heidelberg, pp. 271–285, doi:10.1007/978-3-642-24310-3_19.
  15. Marco Faella (2007): Games you cannot win. Available at http://wpage.unina.it/m.faella/Download/games07.pdf. Workshop on Games and Automata for Synthesis and Validation, Lausanne, Switzerland.
  16. Marco Faella (2009): Admissible Strategies in Infinite Games over Graphs. In: Rastislav Královič & Damian Niwiński: Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Springer Berlin Heidelberg, pp. 307–318, doi:10.1007/978-3-642-03816-7_27.
  17. Christian Frese (2010): A Comparison of Algorithms for Planning Cooperative Motions of Cognitive Automobiles. Technical Report IES-2010-06. Lehrstuhl für Interaktive Echtzeitsysteme, doi:10.5445/KSP/1000021181.
  18. Christian Frese & Jürgen Beyerer (2010): Planning Cooperative Motions of Cognitive Automobiles Using Tree Search Algorithms. In: Rüdiger Dillmann, Jürgen Beyerer, Uwe D. Hanebeck & Tanja Schultz: KI 2010: Advances in Artificial Intelligence, Lecture Notes in Computer Science 6359. Springer Berlin Heidelberg, pp. 91–98, doi:10.1007/978-3-642-16111-7_10.
  19. Paul Gastin, Nathalie Sznajder & Marc Zeitoun (2006): Distributed Synthesis for Well-Connected Architectures. In: S. Arun-Kumar & Naveen Garg: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 4337. Springer Berlin Heidelberg, pp. 321–332, doi:10.1007/11944836_30.
  20. Erich Grädel, Wolfgang Thomas & \voidb@x Thomas Wilke (2002): Automata, Logics, and Infinite Games. LNCS 2500. Springer-Verlag, doi:10.1007/3-540-36387-4.
  21. Lingyi Liu, David Sheridan, Viraj Athavale & Shobha Vasudevan (2011): Automatic generation of assertions from system level design using data mining. In: Formal Methods and Models for Codesign (MEMOCODE), 2011 9th IEEE/ACM International Conference on, pp. 191–200, doi:10.1109/MEMCOD.2011.5970526.
  22. John Lygeros & Nancy Lynch (1998): Strings of vehicles: Modeling and safety conditions. In: Thomas A. Henzinger & Shankar Sastry: Hybrid Systems: Computation and Control, Lecture Notes in Computer Science 1386. Springer Berlin Heidelberg, pp. 273–288, doi:10.1007/3-540-64358-3_45.
  23. John Lygeros, Claire Tomlin & Shankar Sastry (1997): Multiobjective hybrid controller synthesis. In: Oded Maler: Hybrid and Real-Time Systems, Lecture Notes in Computer Science 1201. Springer Berlin Heidelberg, pp. 109–123, doi:10.1007/BFb0014720.
  24. Oscar Mickelin, Necmiye Ozay & Richard M. Murray (2014): Synthesis of Correct-by-construction Control Protocols for Hybrid Systems Using Partial State Information. In: 2014 American Control Conference, pp. 2305–2311, doi:10.1109/ACC.2014.6859229.
  25. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '89. ACM, pp. 179–190, doi:10.1145/75277.75293.
  26. Amir Pnueli & Roni Rosner (1990): Distributed Reactive Systems Are Hard to Synthesize. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, SFCS '90 2. IEEE Computer Society, pp. 746–757, doi:10.1109/FSCS.1990.89597.
  27. M.O. Rabin (1972): Automata on Infinite Objects and Church's Problem. Conference Board of the mathematical science. Conference Board of the Mathematical Sciences, doi:10.1090/cbms/013.
  28. Arthur Richards & Jonathan P. How (2002): Aircraft trajectory planning with collision avoidance using mixed integer linear programming. In: American Control Conference, 2002. Proceedings of the 2002 3, pp. 1936–1941, doi:10.1109/ACC.2002.1023918.
  29. Claire J. Tomlin, George J. Pappas, Jana Košecká, John Lygeros & Shankar S. Sastry (1998): Advanced air traffic automation: A case study in distributed decentralized control. In: Bruno Siciliano & Kimon P. Valavanis: Control Problems in Robotics and Automation. Springer-Verlag, pp. 261–295, doi:10.1007/BFb0015088.
  30. Tichakorn Wongpiromsarn, Ufuk. Topcu & Richard M. Murray (2012): Receding Horizon Temporal Logic Planning. Automatic Control, IEEE Transactions on 57(11), pp. 2817–2830, doi:10.1109/TAC.2012.2195811.
  31. Tichakorn Wongpiromsarn, Ufuk Topcu & Richard M. Murray (2013): Synthesis of Control Protocols for Autonomous Systems. Unmanned Systems 01(01), pp. 21–39, doi:10.1142/S2301385013500027.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org