Skip to main content

Testing equivalence for mobile processes

  • Conference paper
  • First Online:
CONCUR '92 (CONCUR 1992)

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

Included in the following conference series:

Abstract

The impact of applying the testing approach to a calculus of processes with a dynamically changing structure is investigated. A proof system for the finite fragment of the calculus is introduced which consists of two groups of laws: those for strong observational equivalence and those needed to deal with τ actions. Soundness and completeness w.r.t. a testing preorder are shown. A fully abstract denotational model for the language is presented which relies on the existence of normal forms for processes.

Work partially supported by “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo” of CNR, contract n. 91.00894.69 and by Istituto di Elaborazione dell'Informazione of CNR, Pisa.

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.

References

  1. Bergstra,J.A. and Klop,J.-W. Process Theory based on Bisimulation Semantics, in Linear Time, Branching Time and Partial Orders in Logic and Models for Concurrency, LNCS, 354, Springer-Verlag, 1989, 50–122.

    Google Scholar 

  2. Boreale,M. Semantica osservazionale ed assiomatica per un'algebra di processi dinamici, Master Thesis, Università di Pisa, February, 1991.

    Google Scholar 

  3. De Nicola,R. and Hennessy,M. Testing Equivalence for Processes, Theoret. Comput. Sci., 34 (1984), 83–133.

    Article  MATH  MathSciNet  Google Scholar 

  4. De Nicola,R. Extensional Equivalences for Transition Systems, Acta Informatica, 24, 1987, pp. 211–237.

    Article  MATH  MathSciNet  Google Scholar 

  5. De Nicola,R., Inverardi,P. and Nesi,M. Using Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications. In Automatic Verification Methods for Finite State Machines (J. Sifakis, ed.) LNCS 407, 1990; pp. 54–67.

    Google Scholar 

  6. Engberg,U. and Nielsen,M. A Calculus of Communicating Systems with Label Passing; Int. Rep. Computer Science Dept., Aarhus University, DAIMI-PB 208,1986.

    Google Scholar 

  7. Guessarian,I. Algebraic Semantics, LNCS, 99, 1981

    Google Scholar 

  8. Hennessy,M. An Algebraic Theory of Processes, MIT Press, Cambridge, 1988.

    Google Scholar 

  9. Hennessy,M. A Model for the π-Calculus, Internal Report No 8/91, Computer Science, University of Sussex, 1991.

    Google Scholar 

  10. Hennessy,M. and Ingolfsdottir,A,. A Theory of Testing Equivalence with Value-passing, to appear in Information and Computation, 1991

    Google Scholar 

  11. Hoare,C.A.R. Communicating Sequential Process, Prentice Hall Int., London 1985.

    Google Scholar 

  12. Hennessy,M. and Plotkin,G. A Term Model for CCS, LNCS, 88, Springer-Verlag, 1980

    Google Scholar 

  13. Huimin L., Pam: A Process Algebra Manipulator, in Computer Aided Verification(K.G. Larsen and A. Skou, eds) LNCS 575,1992.

    Google Scholar 

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

    Google Scholar 

  15. Milner,R. Communicating and Concurrency. Prentice Hall Int., London 1989.

    Google Scholar 

  16. Milner,R., Parrow,J. and Walker,D. A Calculus of Mobile Processes part I and II, LFCS Report Series, Department of Computer Science, University of Edinburgh, 1989. To appear in Information and Computation.

    Google Scholar 

  17. Plotkin, G. A Structural Approach to Operational Semantics. Technical Report Computer Science Department, Aarhus University, DAIMI FN-19; 1981).

    Google Scholar 

  18. Thomsen,B A Calculus of Higher Order, Proc. of POPL 1989; ACM 1989; pp. 143–154.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W.R. Cleaveland

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boreale, M., De Nicola, R. (1992). Testing equivalence for mobile processes. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084779

Download citation

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

  • 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