Skip to main content
SpringerLink
Log in

Distributed Time-Asynchronous Automata

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2007 (ICTAC 2007)

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

Included in the following conference series:

Abstract

We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata.

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. Abdeddaïm, Y., Maler, O.: Preemptive job-shop scheduling using stopwatch automata. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 113–126. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Asarin, E.: Challenges in timed languages. Bulletin of EATCS 1983 (2004)

    Google Scholar 

  4. Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of ACM 49, 172–206 (2002)

    Article  MathSciNet  Google Scholar 

  5. Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137–162 (2003)

    Article  MATH  Google Scholar 

  6. Dima, C.: Computing reachability relations in timed automata. In: Proceedings of LICS 2002, pp. 177–186 (2002)

    Google Scholar 

  7. Dima, C.: Timed shuffle expressions. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 95–109. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Henzinger, T., 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)

    Chapter  Google Scholar 

  9. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata. J. Comput. Syst. Sci. 57, 94–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Krishnan, P.: Distributed timed automata. Electr. Notes Theor. Comput. Sci. 28 (1999)

    Google Scholar 

  11. Ouaknine, J., Worrell, J.: Revisiting digitization, robustness, and decidability for timed automata. In: Proceedings of LICS 2003, pp. 198–207. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  12. Yovine, S.: Model-checking timed automata. In: Rozenberg, G. (ed.) Lectures on Embedded Systems. LNCS, vol. 1494, pp. 114–152. Springer, Heidelberg (1998)

    Google Scholar 

  13. Zielonka, W.: Notes on finite asynchronous automata. Informatique Théorique et Applications 21(2), 99–135 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LACL, Université Paris 12, 61 av. du Général de Gaulle, 94010 Créteil Cedex, France

    Cătălin Dima

  2. Università dell’Insubria, Via Valleggio 11, 22100, Como, Italy

    Ruggero Lanotte

Authors
  1. Cătălin Dima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruggero Lanotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Cliff B. Jones Zhiming Liu Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dima, C., Lanotte, R. (2007). Distributed Time-Asynchronous Automata. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75292-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75290-5

  • Online ISBN: 978-3-540-75292-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation