Skip to main content

How to Combine Z with a Process Algebra

  • Conference paper
ZUM ’98: The Z Formal Specification Notation (ZUM 1998)

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

Included in the following conference series:

Abstract

The specification language Z has been designed to describe data and functional aspects of systems, but it does not define a semantics for specifications in a distributed setting. Process algebras, on the other hand, concentrate on the behaviour of communicating agents. For this reason the combination of Z with a process algebra recently got a lot of attention. In this paper we summarise and categorise the different approaches and identify pitfalls and shortcomings in existing combinations. Thereby we give an overview over the many possible answers to the question: ‘What is the behavioural semantics of a Z specification?’

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

Access this chapter

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. Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. Information and Computation 115(2), 179–247 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benjamin, M.: A message passing system: an example of combining CSP and Z. In: Nicholls, J.E. (ed.) Z User Workshop, Oxford 1989, Workshops in Computing, pp. 221–228. Springer, Heidelberg (1990)

    Google Scholar 

  4. Butler, M.J., Morgan, C.C.: Action systems, unbounded nondeterminism, and infinite traces. Formal Aspects of Computing 7, 37–53 (1995)

    Article  MATH  Google Scholar 

  5. Back, R.J.R., Sere, K.: Stepwise refinement of action systems. Structured Programming 12, 17–30 (1991)

    Google Scholar 

  6. Bolognesi, T., van de Lagemaat, J., Vissers, C. (eds.): LOTOSphere: Software Development with LOTOS. Kluwer Academic Publishers, Dordrecht (1995)

    Google Scholar 

  7. Derrick, J., Bowman, H., Boiten, E.A., Steen, M.W.A.: Comparing LOTOS and Z refinement relations. In: Gotzhein, R., Bredereke, J. (eds.) Proceedings FORTE 1996, pp. 501–516 (1996)

    Google Scholar 

  8. Derrick, J., Boiten, E.A., Bowman, H., Steen, M.W.A.: Weak refinement in Z. In: Till, D., P. Bowen, J., Hinchey, M.G. (eds.) ZUM 1997. LNCS, vol. 1212, pp. 369–388. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  10. Duke, R., Rose, G., Smith, G.: Object-Z: A specification language advocated for the description of standards. Computer Standards and Interfaces 17, 511–533 (1995)

    Article  Google Scholar 

  11. Evans, A.S.: An improved recipe for specifying reactive systems in Z. In: Till, D., P. Bowen, J., Hinchey, M.G. (eds.) ZUM 1997. LNCS, vol. 1212, pp. 275–294. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Formal Systems (Europe) Ltd. Failures-Divergence Refinement: FDR2 User Manual (October 1997)

    Google Scholar 

  13. Fischer, C., Hallerstede, S.: Data-Refinement in CSP-OZ. Technical Report TRCF-97-3, University of Oldenburg (June 1997)

    Google Scholar 

  14. Fischer, C.: Combining CSP and Z. Technical Report TRCF-97-1, University of Oldenburg (January 1997)

    Google Scholar 

  15. Fischer, C.: CSP-OZ: A combination of Object-Z and CSP. In: Bowmann, H., Derrick, J. (eds.) Formal Methods for Open Object-Based Distributed Systems (FMOODS 1997), vol. 2, pp. 423–438. Chapman & Hall, Boca Raton (1997)

    Google Scholar 

  16. Galloway, A.J.: Integrated Formal Methods with Richer Methodological Profiles for the Development of Multi-Perspective Systems. PhD thesis, University of Teesside, School of Computing and Mathematics (August 1996)

    Google Scholar 

  17. Goltz, U., Gorrieri, R., Rensink, A.: Comparing syntactic and semantic action refinement. Information and Computation 125(2), 118–143 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  18. Galloway, A.J., Habrias, H.: Integrating NIAM, JSD, CCS and Z. Rapport de Recherche IRIN – 130, Université de Nantes, Institut de Recherche en Informatique de Nantes, France (1996)

    Google Scholar 

  19. Galloway, A.J., Stoddart, W.: An operational semantics for ZCCS. In: Hinchey, M.G., Liu, S. (eds.) International Conference of Formal Engineering Methods (ICFEM). IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  20. Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming 8(3), 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  21. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs (1985)

    MATH  Google Scholar 

  22. Heisel, M., Sühl, C.: Formal specification of safety-critical software with Z and real-time CSP. In: Schoitsch, E. (ed.) Proc. 15th International Conference on Computer Safety, Reliability and Security, pp. 31–45 (1997)

    Google Scholar 

  23. Jifeng, H.: Process refinement. In: McDermid, J. (ed.) The Theory and Practice of Refinement, Butterworths (1989)

    Google Scholar 

  24. Jones, C.B.: Systematic Software Development using VDM. Prentice-Hall, Englewood Cliffs (1990)

    MATH  Google Scholar 

  25. Josephs, M.B.: A state-based approach to communicating processes. Distributed Computing 3, 9–18 (1988)

    Article  MATH  Google Scholar 

  26. Mahony, B.P., Dong, J.S.: Blending Object-Z and Timed CSP: An introduction to TCOZ. In: The 20th International Conference on Software Engineering (ICSE 1998), pp. 95–104. IEEE Computer Society Press, Los Alamitos (1998)

    Chapter  Google Scholar 

  27. Milner, R.: Communication and Concurrency. Prentice Hall International Series in Computer Science (1989)

    Google Scholar 

  28. Morgan, C.C.: Programming from Specifications. Prentice Hall International Series in Computer Science (1990)

    Google Scholar 

  29. Mota, A., Sampaio, A.: Model-checking CSP-Z. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 205–220. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  30. Nicholls, J.: Z notation. Draft Version 1.2, ISO (September 1995)

    Google Scholar 

  31. Rensink, A., Gorrieri, R.: Action refinement as an implementation relation. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, pp. 772–786. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  32. Roscoe, A.W., Woodcock, J.C.P., Wulf, L.: Non-interference through determinism. In: Gollmann, D. (ed.) ESORICS 1994. LNCS, vol. 875, pp. 33–54. Springer, Heidelberg (1994)

    Google Scholar 

  33. Smith, G., Derrick, J.: Refinement and verification of concurrent systems specified in Object-Z and CSP. In: Hinchey, M.G., Liu, S. (eds.) International Conference of Formal Engineering Methods (ICFEM), pp. 293–302. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  34. Smith, G.: A fully abstract semantics of classes for Object-Z. Formal Aspects of Computing 7, 30–65 (1995)

    Article  Google Scholar 

  35. Smith, G.: A semantic integration of Object-Z and CSP for the specification of concurrent systems. In: Fitzgerald, J.S., Jones, C.B., Lucas, P. (eds.) FME 1997. LNCS, vol. 1313, pp. 62–81. Springer, Heidelberg (1997)

    Google Scholar 

  36. Spivey, J.M.: The Z Notation: A Reference Manual, 2nd edn. Prentice Hall International Series in Computer Science (1992)

    Google Scholar 

  37. Strulo, B.: How firing conditions help inheritance. In: Bowen, J.P., Hinchey, M.G. (eds.) ZUM 1995. LNCS, vol. 967, pp. 264–275. Springer, Heidelberg (1995)

    Google Scholar 

  38. Taguchi, K., Araki, K.: The state-based CCS semantics for concurrent Z specification. In: Hinchey, M.G., Liu, S. (eds.) International Conference of Formal Engineering Methods (ICFEM), pp. 283–292. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  39. Woodcock, J.C.P., Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice-Hall International Sereies in Computer Science (1996)

    Google Scholar 

  40. Woodcock, J.C.P., Morgan, C.C.: Refinement of state-based concurrent systems. In: Langmaack, H., Hoare, C.A.R., Bjorner, D. (eds.) VDM 1990. LNCS, vol. 428, pp. 340–351. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischer, C. (1998). How to Combine Z with a Process Algebra. In: Bowen, J.P., Fett, A., Hinchey, M.G. (eds) ZUM ’98: The Z Formal Specification Notation. ZUM 1998. Lecture Notes in Computer Science, vol 1493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49676-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49676-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65070-6

  • Online ISBN: 978-3-540-49676-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics