Advertisement

Timed Automata with Monotonic Activities

  • Ruggero Lanotte
  • Andrea Maggiolo-Schettini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1893)

Abstract

The paper introduces TAMA (Timed Automata with Monotonic Activities) a subclass of hybrid automata including as proper subclass TA (Timed Automata), Multirate Automata and Integrator Automata. A subclass of TAMA, called TAMA o, is studied and shown to be equivalent to Timed Automata under the assumption of discrete time, while in dense time TAMA o contains properly the subclasses of hybrid systems mentioned. We also show that TAMA o allow more succinct descriptions than TA.

Keywords

Monotonic Function Input Symbol Hybrid Automaton Dense Time Time Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.H., Nicollin, X., Olivero, A., Sifakis, J. and Yovine, S.: The Algorithmic Analysis of Hybrid Systems, Theoretical Computer Science 138 (1995) 3–34zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alur, R., Dill, D.: A Theory of Timed Automata, Theoretical Computer Science 126, (1994) 183–235zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Alur, R., Limor, F., Henzinger, T. A.: Event-clock automata: a determinizable class of timed automata, Theoretical Computer Science 211 (1999) 253–273zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Drusinsky, D., Harel, D.: On the Power of Bounded Concurrency I: Finite Automata, Journal of ACM 41 (1994) 517–539zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Henzinger, T. A., Manna, Z., Pnueli, A.: What Good are Digital Clocks? In: Kuich, W. (ed.): Automata, languages, and Programming. Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin Heidelberg New York (1992) 545–558Google Scholar
  6. 6.
    Henzinger, T. A., Kopke, P.W., Wong-Toi, H.: The Expressive Power of Clocks. In: Fülöp, Z., Géseg, F. (nt(eds.)): Automata, languages, and Programming. Lecture Notes in Computer Science, Vol. 944, Springer-Verlag, Berlin Heidelberg New York (1995) 335–346Google Scholar
  7. 7.
    Lanotte, R., Maggiolo-Schettini, A., Peron, A.: Timed Cooperating Automata, Fundamenta Informaticae 42 (2000) 1–21MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Ruggero Lanotte
    • 1
  • Andrea Maggiolo-Schettini
    • 1
  1. 1.Dipartimento di InformaticaUniversitá di PisaPisaItaly

Personalised recommendations