Lower and upper bounds in zone-based abstractions of timed automata (original) (raw)

References

  1. Abdeddaim, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theor. Comput. Sci. (in press)
  2. Alur, R., Dill, D.: Automata for modeling real-time systems. In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP’90), vol. 443, Lecture Notes in Computer Science, pp. 322–335. Berlin, Heidelberg, New York: Springer 1990
  3. Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
    Article MathSciNet Google Scholar
  4. Abdeddaim, Y., Maler, O.: Job-shop scheduling using timed automata. In: Proceedings of the 13th International Conference on Computer Aided Verification (CAV’01), vol. 2102, Lecture Notes in Computer Science, pp. 478–492. Berlin, Heidelberg, New York: Springer (2001)
  5. Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static guard analysis in timed automata verification. In: Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’2003), vol. 2619, Lecture Notes in Computer Science, pp. 254–277. Berlin, Heidelberg, New York: Springer 2003
  6. Behrmann, G., Bouyer, P., Larsen, K.G., Pelanek, R.: Lower and upper bounds in zone based abstractions of timed automata. In: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’2004), vol. 2988, Lecture Notes in Computer Science, pp. 312–326. Berlin, Heidelberg, New York: Springer 2004
  7. Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: KRONOS: A model-checking tool for real-time systems. In: Proceedings of the 10th International Conference on Computer Aided Verification (CAV’98), vol. 1427, Lecture Notes in Computer Science, pp. 546–550. Berlin, Heidelberg, New York: Springer 1998
  8. Bengtsson, J.: Clocks, DBMs and States in Timed Systems. PhD thesis, Department of Information Technology, Uppsala University, Uppsala, Sweden 2002
  9. Bouyer, P.: Untameable timed automata! In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS’03), vol. 2607, Lecture Notes in Computer Science, pp. 620–631. Berlin, Heidelberg, New York: Springer 2003
  10. Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods Syst. Des. 24(3), 281–320 (2004)
    Article Google Scholar
  11. Bengtsson, J., Yi, W.: On clock difference constraints and termination in reachability analysis of timed automata. In: Dong, J.S., Woodcock, J. (eds.) Proceedings of ICFEM’03, vol. 2885, Lecture Notes in Computer Science. Berlin, Heidelberg, New York: Springer 2003
  12. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge, MA 1999
    Google Scholar
  13. Dill, D.: Timing assumptions and verification of finite-state concurrent systems. In: Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, vol. 407, Lecture Notes in Computer Science, pp. 197–212. Berlin, Heidelberg, New York: Springer 1989
  14. Daws, C., Tripakis, S.: Model-checking of real-time reachability properties using abstractions. In: Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’98), vol. 1384, Lecture Notes in Computer Science, pp. 313–329. Berlin, Heidelberg, New York: Springer 1998
  15. Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of real-time systems: Compact data structure and state-space reduction. In: Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS’97), pp. 14–24. IEEE Press, New York 1997
  16. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transfer 1(1–2), 134–152 (1997)
    Google Scholar
  17. Rokicki, T.G.: Representing and Modeling Digital Circuits. PhD thesis, Stanford University, Stanford, CA 1993

Download references