Safraless Procedures for Timed Specifications

  • Barbara Di Giampaolo
  • Gilles Geeraerts
  • Jean-François Raskin
  • Nathalie Sznajder
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6246)

Abstract

This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AD94]
    Alur, R., Dill, D.L.: A Theory of Timed Automata. TCS 126(2) (1994)Google Scholar
  2. [AFH99]
    Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. TCS 211(1-2) (1999)Google Scholar
  3. [BCD+̂07]
    Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K., Lime, D.: Uppaal-tiga: Time for playing games! In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 121–125. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. [dAFH+̂03]
    de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 144–158. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. [DGRR09]
    Doyen, L., Geeraerts, G., Raskin, J.-F., Reichert, J.: Realizability of real-time logics. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 133–148. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. [DR10]
    Doyen, L., Raskin, J.-F.: Antichain algorithms for finite automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 2–22. Springer, Heidelberg (2010)Google Scholar
  7. [EJ91]
    Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FCS’91, IEEE, Los Alamitos (1991)Google Scholar
  8. [FJR09]
    Filiot, E., Jin, N., Raskin, J.-F.: An antichain algorithm for ltl realizability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 263–277. Springer, Heidelberg (2009)Google Scholar
  9. [HRS98]
    Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 580–591. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  10. [KV01]
    Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(3) (2001)Google Scholar
  11. [KV05]
    Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS’05. IEEE, Los Alamitos (2005)Google Scholar
  12. [MH84]
    Miyano, S., Hayashi, T.: Alternating finite automata on ω-words. TCS 32 (1984)Google Scholar
  13. [Pit07]
    Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. LMCS 3(3) (2007)Google Scholar
  14. [Ras99]
    Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, FUNDP, Belgium (1999)Google Scholar
  15. [RS98]
    Raskin, J.-F., Schobbens, P.-Y.: The logic of event clocks: decidability, complexity and expressiveness. Automatica 34(3) (1998)Google Scholar
  16. [Saf88]
    Safra, S.: On the complexity of ω-automata. In: FOCS’88. IEEE, Los Alamitos (1988)Google Scholar
  17. [SF07]
    Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474–488. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Barbara Di Giampaolo
    • 1
  • Gilles Geeraerts
    • 2
  • Jean-François Raskin
    • 2
  • Nathalie Sznajder
    • 2
  1. 1.Dipartimento di Informatica ed ApplicazioniUniversità degli Studi di SalernoItaly
  2. 2.Département d’InformatiqueUniversité Libre de Bruxelles (U.L.B.) 

Personalised recommendations