Skip to main content
SpringerLink
Log in

Generalizing the Discrete Timed Automaton

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2088))

Included in the following conference series:

Abstract

We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in parallel.

Supported in part by NSF grant IRI-9700370.

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. R. Alur and D. Dill. Automata for modeling real-time systems. Theoretical Computer Science, 126(2), pp. 83–236, 1994.

    Article  MathSciNet  Google Scholar 

  2. A. Bouajjani, R. Echahed, and R. Robbana. On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures. In Hybrid Systems II, LNCS 999, 1995.

    Google Scholar 

  3. A. Cherubini, L. Breveglieri, C. Citrini, and S.C. Reghizzi. Multiple push-down languages and grammars. Int. J. of Foundations of Computer Science, pp. 253–291, 1996.

    Google Scholar 

  4. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. Proc. 10th Int. Conf. on Computer Aided Verification, pp. 268–279, 1998.

    Google Scholar 

  5. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. Proc. 10th Int. Conf. on Concurrency Theory, pp. 242–257, 1999.

    Google Scholar 

  6. Z. Dang. Verification and Debugging of Infinite State Real-time Systems. Ph.D. Thesis. University of California, Santa Barbara, 2000.

    Google Scholar 

  7. Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, and J. Su. Binary reachability analysis of discrete pushdown timed automata. Int. Conf. on Computer Aided Verification, 2000.

    Google Scholar 

  8. O.H. Ibarra. Reversal-bounded multicounter machines and their decision problems. J. of the Association for Computing Machinery, 25, pp. 116–133, 1978.

    MATH  MathSciNet  Google Scholar 

  9. O.H. Ibarra, T. Bultan, and J. Su. Reachability analysis for some models of infinite-state transition systems. Proc. 10th Int. Conf. on Concurrency Theory, 2000.

    Google Scholar 

  10. O.H. Ibarra, Z. Dang, and P. San Pietro. Queue-Connected Discrete Timed Automata. In preparation.

    Google Scholar 

  11. M. Minsky. Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann. of Math., 74, pp. 437–455, 1961.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra & Jianwen Su

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianwen Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibarra, O.H., Su, J. (2001). Generalizing the Discrete Timed Automaton. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation