Skip to main content
Springer Nature Link
Log in

Weighted Register Automata and Weighted Logic on Data Words

  • Conference paper
  • First Online:
Theoretical Aspects of Computing – ICTAC 2016 (ICTAC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9965))

Included in the following conference series:

  • 534 Accesses

Abstract

In this paper, we investigate automata models for quantitative aspects of systems with infinite data domains, e.g., the costs of storing data on a remote server or the consumption of resources (e.g., memory, energy, time) during a data analysis. We introduce weighted register automata on data words and investigate their closure properties. In our main result, we give a logical characterization of weighted register automata by means of weighted existential monadic second-order logic; for the proof we employ a new class of determinizable visibly register automata.

P. Babari—Supported by DFG Graduiertenkolleg 1763 (QuantLA).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur, R., D’Antoni, L., Deshmukh, J., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: LICS 2013, pp. 13–22. IEEE Computer Society (2013)

    Google Scholar 

  2. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alur, R., Fix, L., Henzinger, T.: Event-clock automata: a determinizable class of timed automata. Theor. Comput. Sci. 211(1–2), 253–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202–211. ACM (2004)

    Google Scholar 

  5. Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Logic 12(4), 27 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Bollig, B.: An automaton over data words that captures EMSO Logic. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 171–186. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 18–38. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Bouyer, P.: A logical characterization of data languages. Inf. Process. Lett. 84(2), 75–85 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bouyer, P., Petit, A., Thérien, D.: An algebraic characterization of data and timed languages. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 248–261. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Büchi, J.R.: Weak second order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Informatik 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  12. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci. 380(1–2), 69–86 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  14. Droste, M., Perevoshchikov, V.: A Nivat theorem for weighted timed automata and weighted relative distance logic. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 171–182. Springer, Heidelberg (2014)

    Google Scholar 

  15. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic 10(3), 30 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Figueira, D.: Alternating register automata on finite data words and trees. Logical Methods Comput. Sci. 8(1: 22), 1–43 (2012)

    MathSciNet  MATH  Google Scholar 

  17. Figueira, D., Hofman, P., Lasota, S.: Relating timed and register automata. In: EXPRESS 2010, EPTCS, vol. 41, pp. 61–75 (2010)

    Google Scholar 

  18. Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134, 329–363 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  19. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403–435 (2004)

    Article  MathSciNet  Google Scholar 

  20. Quaas, K.: MSO logics for weighted timed automata. Formal Methods Syst. Des. 38(3), 193–222 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994. LNCS, vol. 863, pp. 694–715. Springer, Heidelberg (1994). doi:10.1007/3-540-58468-4_191

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, 04109, Leipzig, Germany

    Parvaneh Babari, Manfred Droste & Vitaly Perevoshchikov

Authors
  1. Parvaneh Babari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Droste
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vitaly Perevoshchikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Parvaneh Babari .

Editor information

Editors and Affiliations

  1. Universidade Federal de Pernambuco Centro de Informática, Recife, Pernambuco, Brazil

    Augusto Sampaio

  2. Deptartment of Electrical Engineering BL, National Taiwan University, Taipei, Taiwan

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Babari, P., Droste, M., Perevoshchikov, V. (2016). Weighted Register Automata and Weighted Logic on Data Words. In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46750-4_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46749-8

  • Online ISBN: 978-3-319-46750-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics