Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Completeness of the accumulation calculus

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The accumulation calculus (AC for short) is an interval based temporal logic to specify and reason about hybrid real-time systems. This paper presents a formal proof system for AC, and proves that the system is complete relative to that of Interval Temporal Logic (ITL for short) on real domain.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Pnueli A. The temporal logic of programs. In18th Ann. IEEE Symp. on Foundations of Computer Science, 1977, pp.46–57.

  2. Lamport L. Temporal Logic of Actions. Technical Report 79, Systems Research Center of DEC, USA, 1991.

    Google Scholar 

  3. Manna Z, Pnueli A. Models for reactivity.Acta Informatica, 1993, 30: 609–678.

    Article  MATH  MathSciNet  Google Scholar 

  4. Moszkowski B. A temporal logic for multi-level reasoning about hard ware.IEEE Computer, 1985, 18(2): 10–19.

    Google Scholar 

  5. Zhou Chaochen, Hoare C A R, Ravn A P. A calculus of durations.Information Processing Letters, 1991, 40(5): 269–276.

    Article  MATH  MathSciNet  Google Scholar 

  6. Yu Huiqun, Pandya P K, Sun Yongqiang. A calculus for hybrid sampled data systems. InFormal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, Langmaack H, de Rover W P, Vytopil J (eds.), Springer Verlag, 1994, pp.716–737.

  7. Hansen M R, Zhou Chaochen. Semantics and completeness of duration calculus. InReal-Time: Theory in Practice, LNCS 600, de Bakker J W, Huizing C, de Roever W P, Rozenberg G (eds.), Springer-Verlag, 1992, pp.209–225.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is supported partially by the National Natural Science Foundation of China under the grant No.69703008.

Yu Huiqun received his Ph.D. degree in computer science from Shanghai Jiaotong University. He is currently an Associate Professor in the Department of Computer Science and Engineering at East China University of Science and Technology, Shanghai. His research interests are formal methods, concurrency, reliable real-time systems, semantics of programming languages.

Song Guoxin is a Professor in the Department of Computer Science and Engineering at East China University of Science and Technology, Shanghai. His current research interests are formal methods, object-oriented programming and concurrent engineering.

Sun Yongqiang is a Professor in the Department of Computer Science and Engineering at Shanghai Jiaotong University. His current research interests are formal technique of software development, new paradigm of programming languages, and parallel processing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, H., Song, G. & Sun, Y. Completeness of the accumulation calculus. J. of Comput. Sci. & Technol. 13, 25–31 (1998). https://doi.org/10.1007/BF02946611

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946611

Keywords