Skip to main content
SpringerLink
Log in

Model Checking Restricted Sets of Timed Paths

  • Conference paper
Book cover CONCUR 2004 - Concurrency Theory (CONCUR 2004)

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

Included in the following conference series:

Abstract

In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single finite (or ultimately periodic) timed path, (ii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a region graph, (iii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a zone graph.

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. Alur, R., Courcoubetis, C., Dill, D.L.: Model-Checking in Dense Real-Time. Information and Computation 104(1), 2–34 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alur, R., Feder, T., Henzinger, T.A.: The Benefits of Relaxing Punctuality. Journal of the ACM 43(1), 116–146 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alur, R., Henzinger, T.A.: A Really Temporal Logic. Journal of the ACM 41(1), 181–203 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Alur, R., Kurshan, R.P., Viswanathan, M.: Membership Question for Timed and Hybrid Automata. In: Proc. 19th Symp. Real-Time Systems (RTS 98), December 1998, pp. 254–263. IEEE Comp. Soc. Press, Los Alamitos (1998)

    Google Scholar 

  6. Bouajjani, A., Tripakis, S., Yovine, S.: On-the-Fly Symbolic Model Checking for Real-Time Systems. In: Proc. 18th Symp. Real-Time Systems (RTS 1997), December 1997, pp. 25–35. IEEE Comp. Soc. Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  7. Bruyère, V., Dall’Olio, E., Raskin, J.-F.: Durations, Parametric Model Checking in Timed Automata with Presburger Arithmetic. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 687–698. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Courcoubetis, C., Yannakakis, M.: Minimum and Maximum Delay Problems in Real-Time Systems. Formal Methods in System Design 1(4), 385–415 (1992)

    Article  MATH  Google Scholar 

  9. Manna, Z., Pnueli, A.: Verifying Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 4–35. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  10. Markey, N., Schnoebelen, P.: Model Checking a Path. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 251–265. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Thati, P., Roşu, G.: Monitoring Algorithms for Metric Temporal Logic Specifications. In: Havelund, K., Roşu, G. (eds.) Proc. 4th Intl Workshop on Runtime Verification (RV 2004), April 2004. ENTCS, pp. 131–147. Elsevier Science, Amsterdam (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles Bld du Triomphe, CP 212, 1050, Brussels, Belgium

    Nicolas Markey & Jean-François Raskin

Authors
  1. Nicolas Markey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-François Raskin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College London, 180 Queen’s Gate, SW7 2AZ, London, UK

    Philippa Gardner

  2. Department of Computing, Imperial College, London, UK

    Nobuko Yoshida

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markey, N., Raskin, JF. (2004). Model Checking Restricted Sets of Timed Paths. In: Gardner, P., Yoshida, N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28644-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28644-8_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22940-7

  • Online ISBN: 978-3-540-28644-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation