Skip to main content
SpringerLink
Log in

An Extension of the Testing Method for Processes Passing Infinite Values

  • Conference paper
Book cover NAPAW 92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 35 Accesses

Summary

In this abstract, we present an extended framework for communicating processes capable of passing infinite values. An operational semantics is given by extending the Testing Method which is advocated by De Nicola and Hennessy. Value passing in a communication is observed by a set of tests which approximate the value syntactically in order to treat infinite values. For this purpose, we propose an extended testing system to identify a process by the result of finite testing sequences. It is shown that passing infinite values is characterized by the system we propose in the sense of testing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. Observation Equivalence as a Testing Equivalence. Theoretical Computer Science, 53: 225–241, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  2. G. Boudul. Computational semantics of term rewritng systems. In M. Nivat and J.C. Reynolds, editors, Algebraic Methods in Semantics, pages 169–236. Cambridge University Press, 1985.

    Google Scholar 

  3. E. Brinksma. A Tutorial on LOTOS. Protocol Specification, testing, and Verification, V, pages 171–194, 1986.

    Google Scholar 

  4. P. Henderson. Functional Progamming (Application and Implementation). Prentice-Hall, 1980.

    Google Scholar 

  5. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.

    Google Scholar 

  6. M. Hennessy and A. Ingólfsdóttir, A Theory of Communicating Processes With Value-passing. Lecture Notes in Computer Science, 443: 209–219, 1990.

    Article  Google Scholar 

  7. M.C.B. Hennessy and W. Li. Translating A Subset of ADA into CCS. In D.Bjorner, editor, Formal Description of Programming Concepts — II, pages 227–249. North-Holland, 1982.

    Google Scholar 

  8. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  9. L. Logrippo, A. Obaid, J.P. Briand, and M.C. Fehri. An Interpreter for LOTOS, A Specification Language for Distributed Systems. Software-Practice and Experience, 18(4): 365–385, 1988.

    Article  MATH  Google Scholar 

  10. R. Milner. A Calculus of Communicating Systems. Lecture Note in Computer Science, 92, 1980.

    Google Scholar 

  11. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  12. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes. Technical Report ECS-LFCS-89–85, LFCS Department of Computer Science, Edinburgh University, 1989.

    Google Scholar 

  13. T. Naoi and Y. Inagaki. Algebraic Semantics and Complexity of Term Rewritng Systems. Lecture Notes in Computer Science, 355: 311–325, 1988.

    MathSciNet  Google Scholar 

  14. T. Naoi and Y. Inagaki. Recursive Functions on a Completed Set of Natural Numbers. Technical Report of IEICE, COMP90(1), 1990.

    Google Scholar 

  15. R. De Nicola and M. Hennessy. Testing Equivalences For Processes. Theoretical Computer Science, 34: 83–133, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  16. S. Smolka and R. Strom. A CCS Semantics for NIL. Formal Description of Programming Concepts–III, pages 347–373, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-01, Japan

    Shoji Yuen, Toshiki Sakabe & Yasuyoshi Inagaki

Authors
  1. Shoji Yuen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshiki Sakabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yasuyoshi Inagaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, 333 Whitmore Laboratory, The Pennsylvania State University, 16802, University Park, PA, USA

    S. Purushothaman PhD

  2. Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Amy Zwarico

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Yuen, S., Sakabe, T., Inagaki, Y. (1993). An Extension of the Testing Method for Processes Passing Infinite Values. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3217-2_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19822-2

  • Online ISBN: 978-1-4471-3217-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation