Skip to main content

Advertisement

Springer Nature Link
Log in

Topology in process calculus (I): Limit behaviour of agents

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

Abstract

This paper introduces the modifications on actions of a topology on names of actions and the simplest topology on agents induced by a topology on names of actions and shows that the limit behaviour of some agents is compatible with transitional semantics.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

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

References

  1. Petri C A. Kommunikation mit automaten. Institut fur Instrumentelle Mathematik, Schriften des IIM 2, Bonn, 1962.

  2. Hoare C A R. Communicating sequential processes.Communications of ACM, 1978, 21: 666–677.

    Article  MATH  Google Scholar 

  3. Hoare C A R. Communicating sequential processes. Prentice Hall, New York, 1985.

    MATH  Google Scholar 

  4. Bergstra J A, Klop J-W. Algebra of communicating processes with abstraction.Theoret. Comput. Sci., 1985, 33: 77–121.

    Article  MathSciNet  Google Scholar 

  5. Milner R. A Calculus of Communicating Systems.Lecture Notes in Computer Science 92, Springer-Verlag, Berlin, 1980.

    MATH  Google Scholar 

  6. Milner R. Communication and Concurrency. Prentice Hall, New York 1989

    MATH  Google Scholar 

  7. Engelking R. General Topology. Polish Scientific Publisher, Warszawa, 1977.

    MATH  Google Scholar 

  8. Ying M S. A logic for approximate reasoning.J. Symbolic Logic, 1994, 59: 830–837.

    Article  MATH  MathSciNet  Google Scholar 

  9. Takeuti G, Zaring W M. Introduction to Axiomatic Set Theory. Springer-Verlag, New York, 1982.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, P.R. China

    Ying Mingsheng

Authors
  1. Ying Mingsheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Science Foundation for Excellent Young Scientists, Fok Ying-Tung Education Foundation, the National Research and Development Project of High-Technology and the National Natural Science Foundation of China.

YING Mingsheng graduated from Fuzhou Teachers College in 1981. From 1989 to 1995, he had been in Jiangxi Normal University. In 1996, he joined faculty of Nanjing University of Aeronautics and Astronautics. Now, he is a Professor at Theory Group, Department of Computer Science and Technology, Tsinghua University. His research interests include mainly logic and topology in computer science, fuzzy logic, and uncertainty management in artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ying, M. Topology in process calculus (I): Limit behaviour of agents. J. Comput. Sci. & Technol. 14, 328–336 (1999). https://doi.org/10.1007/BF02948735

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords