Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1992: CONCUR '92 pp 421–435Cite as

The silent step in time

  • Conference paper
  • First Online:

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

Abstract

In untimed process algebras such as CCS and ACP the silent step enables abstraction from internal actions. Several formalizations of abstraction have been introduced, such as observational congruence, delay bisimulation and branching bisimulation. However, in real time process algebras, such as ACPρ, the silent step has not yet received much attention, so far. Therefore, we formalize these semantics regarding the silent step into real time process algebra. We study the characterizing laws, which correspond closely to the untimed laws, and we investigate which of the semantics is appropriate in the context of ACPρ.

This is an extended abstract. The full version will appear as a technical CWI report with the same title.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142–188, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra. In Proceedings 14 th ICALP, Karlsruhe, LNCS 267, pages 84–94. Springer-Verlag, 1987.

    Google Scholar 

  3. J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

    Google Scholar 

  4. W.J. Fokkink. Normal forms in real time process algebra. Report CS-R9149, CWI, Amsterdam, 1991.

    Google Scholar 

  5. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. Report CS-R9120, CWI, Amsterdam, 1991. An extended abstract of an earlier version has appeared in Information Processing 89, North-Holland, 1989.

    Google Scholar 

  6. M. Hennessy and R. Milner. On observing nondeterminism and concurrency. In Proceedings 7 th ICALP, LNCS 85, pages 299–309. Springer-Verlag, 1980. This is a preliminary version of Algebraic laws for nondeterminism and concurrency. JACM 32(1), pp. 137–161, 1985.

    Google Scholar 

  7. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.

    Google Scholar 

  8. A. Jeffrey. Discrete timed CSP. Technical Report Memo 78, Chalmers University, Goteborg, 1991.

    Google Scholar 

  9. A.S. Klusener. Completeness in real time process algebra. Report CS-R9106, CWI, Amsterdam, 1991. An extended abstract appeared in Proceedings CONCUR 91, Amsterdam, LNCS 527, pages 376–392. Springer-Verlag, 1991.

    Google Scholar 

  10. A.S. Klusener. Abstraction in real time process algebra. Report CS-R9144, CWI, Amsterdam, 1991. An extended abstract appeared in Proceedings of the REX workshop “Real-Time: Theory in Practice”, LNCS 600, Springer-Verlag, 1991.

    Google Scholar 

  11. A.S. Klusener. The silent step in time. To appear, CWI, Amsterdam, 1992.

    Google Scholar 

  12. R. Milner. A Calculus of Communicating Systems, LNCS 92. Springer-Verlag, 1980.

    Google Scholar 

  13. R. Milner. Modal characterisation of observable machine behaviour. In Proceedings CAAP 81, LNCS 112, pages 25–34. Springer-Verlag, 1981.

    Google Scholar 

  14. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  15. R. Milner. Communication and concurrency. Prentice Hall International, 1989.

    Google Scholar 

  16. F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proceedings CONCUR 90, Amsterdam, LNCS 458, pages 401–415. Springer-Verlag, 1990.

    Google Scholar 

  17. F. Moller and C. Tofts. Behavioural abstraction in TCCS. To appear in Proceedings ICALP 92, Vienna, LNCS, Springer-Verlag, 1992.

    Google Scholar 

  18. G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  19. F.W. Vaandrager and N.A. Lynch. Action transducers and timed automata. 1992. This Volume.

    Google Scholar 

  20. Y. Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, Göteborg, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Softw. Techn., CWI, P.O. Box 4079, 1009, AB Amsterdam, The Netherlands

    A. S. Klusener

Authors
  1. A. S. Klusener
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W.R. Cleaveland

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klusener, A.S. (1992). The silent step in time. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084807

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55822-4

  • Online ISBN: 978-3-540-47293-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation