Martin, Jeremy M. R., Welch, Peter H. (1997) A Design Strategy for Deadlock-Free Concurrent Systems. Transputer Communications, 3 (4). pp. 215-232. ISSN 1070-454X. (KAR id:21490)
PDF
Language: English |
|
Download this file (PDF/118kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
When building concurrent systems, it would be useful to have a collection of reusable processes
to perform standard tasks. However, without knowing certain details of the inner workings of
these components, one can never be sure that they will not cause deadlock when connected to
some particular network.
Here we describe a hierarchical method for designing complex networks of communicating
processeswhich are deadlock-free.We use this to define a safe and simple method for specifying
the communication interface to third party software components. This work is presented using
the CSP model of concurrency and the occam2.1 programming language.
Item Type: | Article |
---|---|
Additional information: | (In press). Published by John Wiley and Sons |
Uncontrolled keywords: | kroc, occam-pi, process-oriented-programming |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 27 Jul 2009 13:32 UTC |
Last Modified: | 05 Nov 2024 09:59 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21490 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):