Skip to main content

Structured CSP – A Process Algebra as an Institution

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4409))

Included in the following conference series:

Abstract

We introduce two institutions for the process algebra Csp, one for the traces model, and one for the stable failures model. The construction is generic and should be easily instantiated with further models. As a consequence, we can use structured specification constructs like renaming, hiding and parameterisation (that have been introduced over an arbitrary institution) also for Csp. With a small example we demonstrate that structuring indeed makes sense for Csp.

This work has been supported by EPSRC under the grant EP/D037212/1 and by the German DFG under grant KR 1191/5-2.

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. Adámek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley, New York (1990)

    MATH  Google Scholar 

  2. Baumeister, H.: Relations between Abstract Datatypes modeled as Abstract Datatypes. PhD thesis, Universität des Saarlandes (1998)

    Google Scholar 

  3. Bergstra, J.A., Heering, J., Klint, P.: Module algebra. Journal of the ACM 37, 335–372 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  5. Borzyszkowski, T.: Logical systems for structured specifications. Theoretical Computer Science 286, 197–245 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Buth, B., Peleska, J., Shi, H.: Combining methods for the livelock analysis of a fault-tolerant system. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, Springer, Heidelberg (1998)

    Google Scholar 

  7. Buth, B., Schrönen, M.: Model-checking the architectural design of a fail-safe communication system for railway interlocking systems. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Mosses, P.D. (ed.): CASL Reference Manual. LNCS, vol. 2960. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  9. Diaconescu, R., Goguen, J., Stefaneas, P.: Logical support for modularisation. In: Logical Environments, pp. 83–130. Cambridge (1993)

    Google Scholar 

  10. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 2. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  11. Fiadeiro, J.: Categories for Software Engineering. Springer, Heidelberg (2004)

    Google Scholar 

  12. Goguen, J.A., Burstall, R.M.: Institutions: Abstract model theory for specification and programming. Journal of the ACM 39, 95–146 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  14. Isobe, Y., Roggenbach, M.: A complete axiomatic semantics for the CSP stable-failures model. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Mossakowski, T., Autexier, S., Hutter, D.: Development graphs – proof management for structured specifications. Journal of Logic and Algebraic Programming 67(1-2), 114–145 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Roggenbach, M.: CSP-CASL - a new integration of process algebra and algebraic specification. Theoretical Computer Science 354(1), 42–71 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Roggenbach, M., Schröder, L.: Towards trustworthy specifications I: Consistency checks. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, Springer, Heidelberg (2002)

    Google Scholar 

  18. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  19. Ryan, P., Schneider, S., Goldsmith, M., Lowe, G., Roscoe, B.: The Modelling and Analysis of Security Protocols: the CSP Approach. Addison-Wesley, Reading (2001)

    Google Scholar 

  20. Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Information and Computation 76, 165–210 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Luiz Fiadeiro Pierre-Yves Schobbens

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Mossakowski, T., Roggenbach, M. (2007). Structured CSP – A Process Algebra as an Institution. In: Fiadeiro, J.L., Schobbens, PY. (eds) Recent Trends in Algebraic Development Techniques. WADT 2006. Lecture Notes in Computer Science, vol 4409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71998-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71998-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-71998-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics