References

  1. R. Alur & D. Dill (1994): A Theory of Timed Automata. Theoretical Computer Science 126(2), pp. 183–235. Available at http://portal.acm.org/citation.cfm?id=180519.
  2. G. Behrmann, A. David & K. G. Larsen (2004): A Tutorial on UPPAAL. In: Formal Methods for the Design of Real-Time Systems, LNCS 3185. Springer, pp. 200–236. Available at http://www.springerlink.com/content/03wam998tjn5mgma/.
  3. G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn & F. Vaandrager (2001): Minimum-Cost Reachability for Priced Timed Automata. In: HSCC'01, Lecture Notes in Computer Science 2034. Springer, pp. 147–161, doi:10.1007/3-540-45351-2. Available at http://portal.acm.org/citation.cfm?id=710599.
  4. J. Berendsen, D. J. Jansen, J. Schmaltz & F. W. Vaandrager (2010): The axiomatization of override and update. Applied Logic 8(8), pp. 141–150, doi:10.1016/j.jal.2009.11.001. Available at http://www.sciencedirect.com/science/article/pii/S1570868309000676.
  5. P. Bouyer, T. Brihaye, M. Jurdziński, R. Lazi\'c & M. Rutkowski (2008): Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. In: FORMATS'08, LNCS 5215. Springer, pp. 63–77, doi:10.1007/978-3-540-85778-5. Available at http://www.springerlink.com/content/a870592711j40661/.
  6. P. Bouyer, T. Brihaye & N. Markey (2006): Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters 98(5), pp. 188–194, doi:10.1016/j.ipl.2006.01.012. Available at http://portal.acm.org/citation.cfm?id=1711154.
  7. P. Bouyer, E. Brinksma & K. G. Larsen (2004): Staying Alive as Cheaply as Possible. In: HSCC 2004, LNCS 2993. Springer, pp. 203–218. Available at http://www.lsv.ens-cachan.fr/~bouyer/mes-publis.php?onlykey=BBL-hscc2004.
  8. P. Bouyer, E. Brinksma & K. G. Larsen (2008): Optimal Infinite Scheduling for Multi-Priced Timed Automata. Formal Methods in System Design 32(1), pp. 2–23, doi:10.1007/s10703-007-0043-4. Available at http://www.lsv.ens-cachan.fr/~bouyer/mes-publis.php?onlykey=BBL-fmsd06.
  9. P. Bouyer, K. G. Larsen, N. Markey & J. I. Rasmussen (2006): Almost Optimal Strategies in One-Clock Priced Timed Automata. In: FSTTCS'06, LNCS 4337. Springer, pp. 345–356, doi:10.1007/11944836_32. Available at http://www.lsv.ens-cachan.fr/~markey/publis.php?onlykey=BLMR-fsttcs2006.
  10. M. Jurdziński, R. Lazi\'c & M. Rutkowski (2009): Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. In: VMCAI'09 5403. Springer, pp. 167 – 181, doi:10.1007/978-3-540-93900-9. Available at http://www.springerlink.com/content/57635657g2j60414/.
  11. M. Jurdziński & A. Trivedi (2007): Reachability-Time Games on Timed Automata. In: ICALP'07, LNCS 4596. Springer, pp. 838–849, doi:10.1007/978-3-540-73420-8. Available at http://www.springerlink.com/content/b17738g23844w336/.
  12. M. Jurdziński & A. Trivedi (2008): Average-Time Games. In: FSTTCS'08, LIPI 2, pp. 340–351, doi:10.4230/LIPIcs.FSTTCS.2008.1765. Available at http://drops.dagstuhl.de/opus/volltexte/2008/1765/.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org