Skip to main content
SpringerLink
Log in

Reversibility of Executable Interval Temporal Logic Specifications

  • Conference paper
  • First Online:
Reversible Computation (RC 2021)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12805))

Included in the following conference series:

Abstract

In this paper the reversibility of executable Interval Temporal Logic (ITL) specifications is investigated. ITL allows for the reasoning about systems in terms of behaviours which are represented as non-empty sequences of states. It allows for the specification of systems at different levels of abstraction. At a high level this specification is in terms of properties, for instance safety and liveness properties. At concrete level one can specify a system in terms of programming constructs. One can execute these concrete specification, i.e., test and simulate the behaviour of the system. In this paper we will formalise this notion of executability of ITL specifications. ITL also has a reflection operator which allows for the reasoning about reversed behaviours. We will investigate the reversibility of executable ITL specifications, i.e., how one can use this reflection operator to reverse the concrete behaviour of a particular system.

Supported by DMU.

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 EPUB and 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

References

  1. The Isabelle Proof Assistant. https://isabelle.in.tum.de/. Accessed 26 Jan 2020

  2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)

    Article  MathSciNet  Google Scholar 

  3. Cau, A., Kuhn, S., Hoey, J.: Executable interval temporal logic specifications. https://arxiv.org/abs/2105.03375 (2021)

  4. Cau, A., Moszkowski, B.: The ITL homepage. http://antonio-cau.co.uk/ITL/ (2019). Accessed 26 Jan 2020

  5. Hoey, J., Ulidowski, I.: Reversible imperative parallel programs and debugging. In: Thomsen, M.K., Soeken, M. (eds.) RC 2019. LNCS, vol. 11497, pp. 108–127. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21500-2_7

    Chapter  MATH  Google Scholar 

  6. Hoey, J., Ulidowski, I., Yuen, S.: Reversing parallel programs with blocks and procedures. EXPRESS/SOS 2018, 69–86 (2018)

    MathSciNet  Google Scholar 

  7. Lutz, C.: Janus: a time-reversible language. A letter to Dr. Landauer (1986). http://tetsuo.jp/ref/janus.pdf

  8. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1992). https://doi.org/10.1007/978-1-4612-0931-7

  9. Moszkowski, B.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  10. Moszkowski, B.: Compositional reasoning using intervals and time reversal. Ann. Math. Artif. Intell. 175–250 (2013). https://doi.org/10.1007/s10472-013-9356-8

  11. Perumalla, K.: Introduction to Reversible Computing. CRC Press, Boca Raton (2014)

    Google Scholar 

  12. Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp. 46–57, October 1977

    Google Scholar 

  13. Prior, A.N.: Diodoran modalities. Philos. Q. 5(20), 205–213 (1955)

    Article  Google Scholar 

  14. Ulidowski, I., Lanese, I., Schultz, U.P., Ferreira, C. (eds.): RC 2020. LNCS, vol. 12070. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-47361-7

  15. Zhou, S., Zedan, H., Cau, A.: Run-time analysis of time-critical systems. J. Syst. Archit. 51(5), 331–345 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Informatics, De Montfort University, Leicester, UK

    Antonio Cau & Stefan Kuhn

  2. School of Informatics, University of Leicester, Leicester, UK

    James Hoey

Authors
  1. Antonio Cau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Kuhn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. James Hoey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio Cau .

Editor information

Editors and Affiliations

  1. Ritsumeikan University, Kusatsu, Japan

    Shigeru Yamashita

  2. Nanzan University, Nagoya, Japan

    Tetsuo Yokoyama

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cau, A., Kuhn, S., Hoey, J. (2021). Reversibility of Executable Interval Temporal Logic Specifications. In: Yamashita, S., Yokoyama, T. (eds) Reversible Computation. RC 2021. Lecture Notes in Computer Science(), vol 12805. Springer, Cham. https://doi.org/10.1007/978-3-030-79837-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-79837-6_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-79836-9

  • Online ISBN: 978-3-030-79837-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation