Skip to main content

Probabilistic Neighbourhood Logic

  • Conference paper
  • First Online:
Book cover Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 2000)

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

Abstract

This paper presents a probabilistic extension of Neighbourhood Logic (NL,[14],[1]). The study of such an extension is motivated by the need to supply the Probabilistic Duration Calculus (PDC, [10],[4]) with a proof system. The relation between the new logic and PDC is similar to that between DC [15] and ITL [12],[3]. We present a complete proof system for the new logic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. Barua, R. S. Roy and Zhou Chaochen. Completeness of Neighbourhood Logic. Proceedings of STACS’99, Trier, Germany, LNCD 1563, Springer Verlag, 1999.

    Google Scholar 

  2. Chang, C. C. and H. J. Keisler. Model Theory. North Holland, Amsterdam, 1973.

    Google Scholar 

  3. Dutertre, B. On First Order Interval Temporal Logic Report no. CSD-TR-94-3 Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, England, 1995.

    Google Scholar 

  4. Dang Van Hung and Zhou Chaochen. Probabilistic Duration Calculus for Continuous Time. Formal Aspects of Computing, 11, pp. 21–44, 1999.

    Article  MATH  Google Scholar 

  5. Guelev, D. P. A Calculus of Durations on Abstract Domains: Completeness and Extensions. Technical Report 139, UNU/IIST, P.O.Box 3058, Macau, May 1998.

    Google Scholar 

  6. Guelev, D. P. Probabilistic Interval Temporal Logic, Technical Report 144, UNU/IIST, P.O.Box 3058, Macau, August 1998, Draft.

    Google Scholar 

  7. Guelev, D. P. Probabilistic and Temporal Modal Logics, Ph.D. thesis, submitted.

    Google Scholar 

  8. Guelev, D. P. Interval-related Interpolation in Interval Temporal Logics, submitted, 1999.

    Google Scholar 

  9. Guelev, D. P. Probabilistic Neighbourhood Logic. Technical Report 196, UNU/IIST, P.O.Box 3058, Macau, April 2000.

    Google Scholar 

  10. Liu Zhiming, A. P. Ravn, E. V. SØrensen and Zhou Chaochen. A Probabilistic Duration Calculus. In: Proceedings of the Second International Workshop on Responsive Computer Systems. KDD Research and Development Laboratories, Saitama, Japan, 1992.

    Google Scholar 

  11. Mathai, J. Real-Time Systems. Prentice Hall, 1995.

    Google Scholar 

  12. Moszkowski, B. Temporal Logic For Multilevel Reasoning About Hardware. IEEE Computer, 18(2):10–19, February 1985.

    Google Scholar 

  13. Trifonov, V. T. A completeness theorem for the probabilistic interval temporal logic with respect to its standard semantics, M.Sc. thesis, Sofia University, July 1999. (In Bulgarian)

    Google Scholar 

  14. Zhou Chaochen, and M. R. Hansen. An Adequate First Order Interval Logic. International Symposium, Compositionality-The Significant Difference, H. Langmaack, A. Pnueli and W.-P. de Roever (eds.), Springer, 1998.

    Google Scholar 

  15. Zhou Chaochen, C. A. R. Hoare and A. P. Ravn. A Calculus of Durations. Information Processing Letters, 40(5), pp. 269–276, 1991.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guelev, D.P. (2000). Probabilistic Neighbourhood Logic. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45352-0_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41055-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics