Skip to main content
SpringerLink
Log in

Timed Weak Simulation Verification and Its Application to Stepwise Refinement of Real-Time Software

  • Conference paper
Embedded and Ubiquitous Computing – EUC 2005 (EUC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3824))

Included in the following conference series:

Abstract

Real-time software runs over real-time operating systems, and guaranteeing qualities are difficult. In this paper, we propose timed weak simulation relation verification and apply it to a refinement design method of real-time software. Moreover, we apply our proposed method to general real-time software scheduled by fixed-priority preemptive policy.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Liu, J.W.S.: Real-Time System. Prentice-Hall, Englewood Cliffs (2000)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Buttazzo, G.C.: Hard Real-Time Computing Systems. Kluwer Academic Publishers, Dordrecht (1987)

    Google Scholar 

  4. Milner, R.: Operational and Algebraic Semantics of Concurrent Processes. In: Handbook of Theoretical Computer Science, pp. 1201–1242. MIT Press, Cambridge (1990)

    Google Scholar 

  5. Alur, R., Fix, L., Henzinger, T.A.: Event-Clock Automata: A Determinizable Class of Timed Automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 1–13. Springer, Heidelberg (1994)

    Google Scholar 

  6. Dima, C.: Removing slient transitions from event-clock automata. In: Proc. of CITTI 2000, pp. 75–81 (2000)

    Google Scholar 

  7. Pnueli, A.: Linear and Branching Structures in the Semantics and Logics of Reactive Systems. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 15–32. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  8. Cerans, K.: Decidability of bisimulation equivalences for parallel timer processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 269–300. Springer, Heidelberg (1993)

    Google Scholar 

  9. Tasiran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying Abstractions of Timed Systems. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 546–562. Springer, Heidelberg (1996)

    Google Scholar 

  10. Braberman, V., Felder, M.: Verification of Real-Time Designs: Combining Scheduling Theory with Automatic Formal Verification. In: Nierstrasz, O., Lemoine, M. (eds.) ESEC 1999 and ESEC-FSE 1999. LNCS, vol. 1687, pp. 494–510. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111, 193–244 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Joseph, M.: Real-Time System Specification, Verification and Analysis. Prentice Hall, Englewood Cliffs (1996)

    Google Scholar 

  13. Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic symbolic verification of embedded systems. IEEE Trans. on Software Engineering 22(3), 181–201 (1996)

    Article  Google Scholar 

  14. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? Journal of Computer and System Sciences 57, 94–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Natural Science, Kanazawa University, Kanazawa City, Japan, ZIP/CODE 920-1192

    Satoshi Yamane

Authors
  1. Satoshi Yamane
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  2. Faculty of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi-ku, 819-0395, Fukuoka, Japan

    Makoto Amamiya

  3. IBM T.J. Watson Research Center, Hawthorne, NY, USA

    Zhen Liu

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  5. Heinz Nixdorf Institute, University of Paderborn, Fuerstenallee 11, 33102, Paderborn, Germany

    Franz J. Rammig

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamane, S. (2005). Timed Weak Simulation Verification and Its Application to Stepwise Refinement of Real-Time Software. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds) Embedded and Ubiquitous Computing – EUC 2005. EUC 2005. Lecture Notes in Computer Science, vol 3824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596356_40

Download citation

  • DOI: https://doi.org/10.1007/11596356_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30807-2

  • Online ISBN: 978-3-540-32295-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation