Skip to main content
SpringerLink
Log in
Book cover

NAPAW 92 pp 86–100Cite as

Exception Handling in Process Algebra

  • Conference paper

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

Abstract

We study exception handling as it occurs, e.g., in ADA, aiming at an algebraic characterization. We take Bergstra and Klop’s Algebra of Communicating Processes (ACP) as our starting point and equationally define strong bisimulation for ACP extended with exception handling primitives. This theory is then applied to showing fault tolerance under an explicitly stated fault hypothesis of a system that is made more fault resilient by applying dynamic redundancy.

NWO/SION project “Research and Education in Computer Science (REX).”

NWO/SION project “Fault Tolerance: Paradigms, Models, Logics, Construction.”

ESPRIT project: “Building Correct Reactive Systems (REACT).”

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Aczel. Non-well-founded sets. Number 14 in CSLI Lecture Notes. 1988.

    Google Scholar 

  2. American National Standards Institute, Inc. The Programming Language Ada Reference Manual. LNCS 155, Springer-Verlag 1983.

    Google Scholar 

  3. J.A. Bergstra & J.W. Klop. Process Algebra for Synchronous Communication. Information and Control 60: 109–137, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  4. J.C.M. Baeten & W.P. Wetland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, Vol 18, 1990.

    Google Scholar 

  5. F. Cristian. A Rigorous Approach to Fault-Tolerant Programming. IEEE Transactions on Software Engineering 11: 23–31, 1985.

    Article  Google Scholar 

  6. T.I. Dix. Exceptions and Interrupts in CSP. Science of Computer Programming 3: 189–204, 1983.

    Article  MATH  Google Scholar 

  7. J.F. Groote. Transition System Specifications with Negative Premises. Proc. CONCUR ‘80, LNCS 443 pp. 332–341, 1990.

    Google Scholar 

  8. J.F. Groote Process Algebra and Structured Operational Semantics. PhD Thesis Centre for Mathematics and Computer Science, University of Amsterdam, 1991.

    Google Scholar 

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

    Google Scholar 

  10. He Jifeng & C.A.R. Hoare. Algebraic Specification and Proof of a Distributed Recovery Algorithm. Distributed Computing 2: 1–12, 1987.

    Article  MATH  Google Scholar 

  11. K. Lodaya & R.K. Shyamasundar. Proof Theory for Exception Handling in a Tasking Environment. Acta Informatics 28: 7–42, 1990.

    Article  MATH  Google Scholar 

  12. R. Milner. Communication and Concurrency. Prentice-Hall 1989.

    Google Scholar 

  13. J. Peleska. Design and Verification of Fault Tolerant Systems with CSP. Distributed Computing 5: 95–106, 1991.

    Article  MATH  Google Scholar 

  14. K.V.S. Prasad. Specification and Proof of a Simple Fault Tolerant System in CCS. Internal Report CSR-1178–84, Department of Computer Science, University of Edinburgh, 1984.

    Google Scholar 

  15. K.V.S. Prasad. Combinators and Bisimulation Proofs for Restartable Systems. PhD Thesis University of Edinburgh, 1987.

    Google Scholar 

  16. J.J.M.M. Rutten. Processes as terms: non-well-founded models for bisimulation. Technical report CWI CS-R9211, also to appear in Mathematical Structures in Computer Science.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    F. S. de Boer, J. Coenen & R. Gerth

Authors
  1. F. S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Coenen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Gerth
    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

de Boer, F.S., Coenen, J., Gerth, R. (1993). Exception Handling in Process Algebra. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_6

Download citation

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

  • 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