Skip to main content
SpringerLink
Log in

Toward a Structure Theory of Regular Infinitary Trace Languages

  • Conference paper
Automata, Languages, and Programming (ICALP 2014)

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

Included in the following conference series:

Abstract

The family of regular languages of infinite words is structured into a hierarchy where each level is characterized by a class of deterministic ω-automata – the class of deterministic Büchi automata being the most prominent among them. In this paper, we analyze the situation of regular languages of infinite Mazurkiewicz traces that model non-terminating, concurrent behaviors of distributed systems. Here, a corresponding classification is still missing. We introduce the model of “synchronization-aware asynchronous automata”, which allows us to initiate a classification of regular infinitary trace languages in a form that is in nice correspondence to the case of ω-regular word languages.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaturvedi, N.: Languages of infinite traces and deterministic asynchronous automata. Technical Report AIB-2014-04, RWTH Aachen University (2014)

    Google Scholar 

  2. Chaturvedi, N., Gelderie, M.: Weak ω-Regular Trace Languages. arXiv.org, CoRR abs/1402.3199 (2014)

    Google Scholar 

  3. Diekert, V., Muscholl, A.: Deterministic asynchronous automata for infinite traces. Acta Informatica 31(4), 379–397 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific Publishing Co., Inc., River Edge (1995)

    Google Scholar 

  5. Gastin, P., Petit, A.: Asynchronous cellular automata for infinite traces. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 583–594. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  6. Madhavan, M.: Automata on distributed alphabets. In: D’Souza, D., Shankar, P. (eds.) Modern Applications of Automata Theory. IISc Research Monographs Series, vol. 2, pp. 257–288. World Scientific (May 2012)

    Google Scholar 

  7. Muscholl, A.: Über die Erkennbarkeit unendlicher Spuren. PhD thesis (1994)

    Google Scholar 

  8. Perrin, D., Pin, J.-É.: Automata and Infinite Words. In: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141. Elsevier (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik 7, RWTH Aachen University, Aachen, Germany

    Namit Chaturvedi

Authors
  1. Namit Chaturvedi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Boltzmannstrasse 3, 85748, München, Germany

    Javier Esparza

  2. LIAFA, Université Paris Diderot-Paris 7, Case 7014, 75205, Paris Cedex 13, France

    Pierre Fraigniaud

  3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Thore Husfeldt

  4. Department Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK,

    Elias Koutsoupias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaturvedi, N. (2014). Toward a Structure Theory of Regular Infinitary Trace Languages. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43951-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43950-0

  • Online ISBN: 978-3-662-43951-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation