References

  1. Parosh Aziz Abdulla, Mohamed Faouzi Atig & Jari Stenman (2012): Dense-Timed Pushdown Automata. In: Proc. 27th LICS. IEEE Computer Society, pp. 35–44, doi:10.1109/LICS.2012.15.
  2. Rajeev Alur & David L. Dill (1994): A Theory of Timed Automata. Theoretical Computer Science 126(2), pp. 183–235, doi:10.1016/0304-3975(94)90010-8.
  3. Rajeev Alur, Kousha Etessami & Parthasarathy Madhusudan (2004): A Temporal Logic of Nested Calls and Returns. In: Proc. 10th TACAS, LNCS 2988. Springer, pp. 467–481, doi:10.1007/978-3-540-24730-2_35.
  4. Rajeev Alur, Tomás Feder & Thomas A. Henzinger (1996): The Benefits of Relaxing Punctuality. J. ACM 43(1), pp. 116–146, doi:10.1145/227595.227602.
  5. Rajeev Alur, Limor Fix & Thomas A. Henzinger (1999): Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211(1-2), pp. 253–273, doi:10.1016/S0304-3975(97)00173-4.
  6. Rajeev Alur & Thomas A. Henzinger (1993): Real-Time Logics: Complexity and Expressiveness. Inf. Comput. 104(1), pp. 35–77, doi:10.1006/inco.1993.1025.
  7. Rajeev Alur & Parthasarathy Madhusudan (2004): Visibly Pushdown Languages. In: Proc. 36th STOC. ACM, pp. 202–211, doi:10.1145/1007352.1007390.
  8. Christel Baier & Joost-Pieter Katoen (2008): Principles of Model Checking. The MIT Press.
  9. Massimo Benerecetti, Stefano Minopoli & Adriano Peron (2010): Analysis of Timed Recursive State Machines. In: TIME 2010 - 17th International Symposium on Temporal Representation and Reasoning, Paris, France, 6-8 September 2010, pp. 61–68, doi:10.1109/TIME.2010.10.
  10. Massimo Benerecetti & Adriano Peron (2016): Timed recursive state machines: Expressiveness and complexity. Theoretical Computer Science 625, pp. 85–124, doi:10.1016/j.tcs.2016.02.021.
  11. Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade & Ashutosh Trivedi (2016): A Logical Characterization for Dense-Time Visibly Pushdown Automata. In: Proc. 10th LATA, LNCS 9618. Springer, pp. 89–101, doi:10.1007/978-3-319-30000-9_7.
  12. Ahmed Bouajjani, Rachid Echahed & Riadh Robbana (1994): On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures. In: Hybrid Systems II, pp. 64–85, doi:10.1007/3-540-60472-3_4.
  13. L. Bozzelli, A. Murano & A. Peron (2010): Pushdown Module Checking.. Formal Methods in System Design 36(1), pp. 65–95, doi:10.1007/s10703-010-0093-x.
  14. L. Bozzelli, A. Peron & A. Murano (2018): Event-clock Nested Automata. In: Proc. 12th LATA, LNCS 10792. Springer, pp. 80–92, doi:10.1007/978-3-319-77313-1_6.
  15. Laura Bozzelli, Aniello Murano & Adriano Peron (2018): Timed contex-free temporal logics (extended version). http://arxiv.org/abs/1808.04271. Available at http://arxiv.org/abs/1808.04271.
  16. K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger & J. Palsberg (2003): Stack Size Analysis for Interrupt-Driven Programs. In: Proc. 10th SAS, LNCS 2694. Springer, pp. 109–126, doi:10.1007/3-540-44898-5_7.
  17. Lorenzo Clemente & Slawomir Lasota (2015): Timed Pushdown Automata Revisited. In: Proc. 30th LICS. IEEE Computer Society, pp. 738–749, doi:10.1109/LICS.2015.73.
  18. Michael Emmi & Rupak Majumdar (2006): Decision Problems for the Verification of Real-Time Software. In: Proc. 9th HSCC, LNCS 3927. Springer, pp. 200–211, doi:10.1007/11730637_17.
  19. Ron Koymans (1990): Specifying Real-Time Properties with Metric Temporal Logic. Real-Time Systems 2(4), pp. 255–299, doi:10.1007/BF01995674.
  20. M.L. Minsky (1967): Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs.
  21. Joël Ouaknine & James Worrell (2006): On Metric Temporal Logic and Faulty Turing Machines. In: Proc. 9th FOSSACS, LNCS 3921. Springer, pp. 217–230, doi:10.1007/11690634_15.
  22. Joël Ouaknine & James Worrell (2007): On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science 3(1), doi:10.2168/LMCS-3(1:8)2007.
  23. Jean-François Raskin & Pierre-Yves Schobbens (1999): The Logic of Event Clocks - Decidability, Complexity and Expressiveness. Journal of Automata, Languages and Combinatorics 4(3), pp. 247–286.
  24. Nguyen Van Tang & Mizuhito Ogawa (2009): Event-Clock Visibly Pushdown Automata. In: Proc. 35th SOFSEM, LNCS 5404. Springer, pp. 558–569, doi:10.1007/978-3-540-95891-8_50.
  25. Ashutosh Trivedi & Dominik Wojtczak (2010): Recursive Timed Automata. In: Proc. 8th ATVA, LNCS 6252. Springer, pp. 306–324, doi:10.1007/978-3-642-15643-4_23.
  26. I. Walukiewicz (1996): Pushdown Processes: Games and Model Checking.. In: CAV'96, pp. 62–74, doi:10.1007/3-540-61474-5_58.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org