Advertisement

Abstraction in real time process algebra

  • A. S. Klusener
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 600)

Abstract

In this paper we extend Real Time Process Algebra by the silent step τ. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting τ-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability of this notion of real time abstraction by proving the PAR protocol (Positive Acknowledgement with Retransmission) correct.

1985 Mathematics Subject Classification

68Q60 

1982 CR Categories

D.3.1 F.3.1 J.7 

Key Words & Phrases

Real Time Process Algebra ACP Abstraction Protocol Verification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bae90]
    J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17. Cambridge University Press, 1990.Google Scholar
  2. [BB91]
    J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142–188, 1991.CrossRefGoogle Scholar
  3. [BW90]
    J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.Google Scholar
  4. [dR89]
    W.P. de Roever. Foundations of computer science: Leaving the ivory tower. Bulletin of the European Association for Theoretical Computer Science, 44:455–492, 1989.Google Scholar
  5. [Gla87]
    R.J. van Glabbeek. Bounded nondeterminism and the approximation induction principle in process algebra. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proceedings STACS 87, volume 247 of Lecture Notes in Computer Science, pages 336–347. Springer-Verlag, 1987.Google Scholar
  6. [Gro89]
    J.F. Groote. Transition system specifications with negative premises. Report CS-R8950, CWI, Amsterdam, 1989. An extended abstract appeared in J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, LNCS 458, pages 332–341. Springer-Verlag, 1990.Google Scholar
  7. [GW89]
    R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In G.X. Ritter, editor, Information Processing 89, pages 613–618. North-Holland, 1989.Google Scholar
  8. [Hoa85]
    C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.Google Scholar
  9. [HR90]
    M. Hennessy and T. Regan. A temporal process algebra. Report 2/90, Computer Science Department, University of Sussex, 1990.Google Scholar
  10. [Klu91]
    A.S. Klusener. Completeness in realtime process algebra. Report CS-R9106, CWI, Amsterdam, 1991. An extended abstract appeared in J.C.M. Baeten and J.F. Groote, editors, Proceedings CONCUR 91, Amsterdam, LNCS 527, pages 376–392. Springer-Verlag, 1991.Google Scholar
  11. [Mil80]
    R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.Google Scholar
  12. [Mil89]
    R. Milner. Communication and concurrency. Prentice Hall International, 1989.Google Scholar
  13. [MT90]
    F. Moller and C Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 401–415. Springer-Verlag, 1990.Google Scholar
  14. [Plo81]
    G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
  15. [Ree89]
    M. Reed. A hierarchy of domains for real-time distributed computing. In Mathematical Foundations of Programming Language Semantics. Springer-Verlag, 1989.Google Scholar
  16. [RR88]
    M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249–261, 1988.CrossRefGoogle Scholar
  17. [Wan90]
    Y. Wang. Real time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 502–520. Springer-Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • A. S. Klusener
    • 1
  1. 1.CWIAB AmsterdamThe Netherlands

Personalised recommendations