References

  1. Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas & James Worrell (2008): Universality Analysis for One-Clock Timed Automata. Fundam. Inform. 89(4), pp. 419–450. Available at http://iospress.metapress.com/content/xx63231v71037607/.
  2. Luca Aceto & Anna Ingólfsdóttir (2006): Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Austria, March 25-31, 2006, Proceedings. Lecture Notes in Computer Science 3921. Springer.
  3. Rajeev Alur & David L. Dill (1994): A Theory of Timed automata. Theor. Comput. Sci. 126(2), pp. 183–235. Available at http://dx.doi.org/10.1016/0304-3975(94)90010-8.
  4. Rajeev Alur, Kousha Etessami, Salvatore La Torre & Doron Peled (2001): Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2(3), pp. 388–407. Available at http://doi.acm.org/10.1145/377978.377990.
  5. Rajeev Alur, Tomás Feder & Thomas A. Henzinger (1996): The Benefits of Relaxing Punctuality. J. ACM 43(1), pp. 116–146. Available at http://doi.acm.org/10.1145/227595.227602.
  6. Rajeev Alur, Thomas A. Henzinger & Moshe Y. Vardi (1993): Parametric real-time reasoning. In: Kosaraju, pp. 592–601. Available at http://doi.acm.org/10.1145/167088.167242.
  7. Roberto M. Amadio (2008): Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. Lecture Notes in Computer Science 4962. Springer.
  8. Laura Bozzelli & Salvatore La Torre (2009): Decision problems for lower/upper bound parametric timed automata. Formal Methods in System Design 35(2), pp. 121–151. Available at http://dx.doi.org/10.1007/s10703-009-0074-0.
  9. Daniel Brand & Pitro Zafiropulo (1983): On Communicating Finite-State Machines. J. ACM 30(2), pp. 323–342. Available at http://doi.acm.org/10.1145/322374.322380.
  10. Adrian Horia Dediu, Henning Fernau & Carlos Martín-Vide (2010): Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings. Lecture Notes in Computer Science 6031. Springer. Available at http://dx.doi.org/10.1007/978-3-642-13089-2.
  11. Stéphane Demri & Ranko Lazi\'c (2009): LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3). Available at http://doi.acm.org/10.1145/1507244.1507246.
  12. Stéphane Demri, Ranko Lazi\'c & Arnaud Sangnier (2008): Model Checking Freeze LTL over One-Counter Automata. In: Amadio, pp. 490–504. Available at http://dx.doi.org/10.1007/978-3-540-78499-9_34.
  13. Barbara Di Giampaolo, Salvatore La Torre & Margherita Napoli (2010): Parametric Metric Interval Temporal Logic. In: Dediu, pp. 249–260. Available at http://dx.doi.org/10.1007/978-3-642-13089-2_21.
  14. Thomas Henzinger (1991): The temporal specification and verification of real-time systems.. Stanford University. Technical Report STAN-CS-91-1380.
  15. Thomas Hune, Judi Romijn, Mariëlle Stoelinga & Frits W. Vaandrager (2002): Linear parametric model checking of timed automata. J. Log. Algebr. Program. 52-53, pp. 183–220. Available at http://dx.doi.org/10.1016/S1567-8326(02)00037-1.
  16. S. Rao Kosaraju, David S. Johnson & Alok Aggarwal (1993): Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA. ACM.
  17. Ron Koymans (1990): Specifying Real-Time Properties with Metric Temporal Logic. Real-Time Systems 2(4), pp. 255–299. Available at http://dx.doi.org/10.1007/BF01995674.
  18. Joël Ouaknine & James Worrell (2006): On Metric Temporal Logic and Faulty Turing Machines. In: Aceto & Ingólfsdóttir, pp. 217–230. Available at http://dx.doi.org/10.1007/11690634_15.
  19. 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). Available at http://dx.doi.org/10.2168/LMCS-3(1:8)2007.

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