Skip to main content

Behavioural abstraction in TCCS

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1992)

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

Included in the following conference series:

  • 158 Accesses

Abstract

In this paper, we extend the theory of TCCS, the authors' Temporal Calculus of Communicating Systems, with a behavioural congruence which abstracts away internal communications. An equational theory for this equivalence is presented, and proven to be complete over the sublanguage of finite sequential agents.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baeten, J.C.M. and J.A. Bergstra, Real Time Process Algebra, Formal Aspects of Computing, Vol 3, 1991.

    Google Scholar 

  2. Chen, L., Decidability and Completeness in Real Time Processes, Research Report No ECS-LFCS-91-185, University of Edinburgh Department of Computer Science, 1991.

    Google Scholar 

  3. Groote, J.F., Specification and Verification of Real Time Systems in ACP, Proceedings of the 10th International Symposium on Protocol Specification, Testing and Verification, Ottawa, 1990.

    Google Scholar 

  4. Hennessy, M.C., Algebraic Theory of Processes, MIT Press, 1988.

    Google Scholar 

  5. Hennessy, M. and T. Regan, A Temporal Process Algebra Technical Report No. 2/90, University of Sussex Department of Computer Science, April 1990.

    Google Scholar 

  6. Milner, R., Calculi for Synchrony and Asynchrony, Theoretical Computer Science, Vol 25, 1983.

    Google Scholar 

  7. Milner, R., Communication and Concurrency, Prentice-Hall International, 1989.

    Google Scholar 

  8. Moller, F. and C. Tofts, A Temporal Calculus of Communicating Systems, Proceedings of CONCUR'90, LNCS 458, Springer-Verlag, 1990.

    Google Scholar 

  9. Moller, F. and C. Tofts, Relating Processes with Respect to Speed, Proceedings of CONCUR'91, LNCS 527, Springer-Verlag, 1990.

    Google Scholar 

  10. Moller, F. and C. Tofts, An Overview of TCCS, Research Report, University of Edinburgh Department of Computer Science, 1992.

    Google Scholar 

  11. Moller, F., Process Algebra as a Tool for Real Time Analysis, IV Banff Higher Order Workshop, Springer-Verlag, 1991.

    Google Scholar 

  12. Moller, F., The Edinburgh Concurrency Workbench (Version 6.0), Technical Note No LFCS-TN-34, University of Edinburgh Computer Science Department, 1991.

    Google Scholar 

  13. Nicollin, X., J.L. Richier, J. Sifakis and J.Voiron, ATP: An Algebra for Timed Processes, Proceedings of IFIP Working Conference on Programming Concepts and Methods, North Holland, 1990.

    Google Scholar 

  14. Reed, G.M. and A. Roscoe, A Timed Model for Communicating Sequentail Processes, Proceedings of ICALP'86, LNCS 226, Springer-Verlag, 1986.

    Google Scholar 

  15. Wang Yi, Real-time Behaviour of Asynchronous Agents, Proceedings of CONCUR'90, LNCS 458, Springer-Verlag, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W. Kuich

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moller, F., Tofts, C. (1992). Behavioural abstraction in TCCS. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-55719-9_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55719-7

  • Online ISBN: 978-3-540-47278-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics