Skip Navigation


The Computer Journal Advance Access originally published online on July 17, 2007
The Computer Journal 2007 50(5):535-554; doi:10.1093/comjnl/bxm018
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
50/5/535    most recent
bxm018v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fallah, M. S.
Right arrow Articles by Sharafat, A. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Service Availability in Concurrent Systems—Part II: Analysis and Case Studies Using HSIP

Mehran S. Fallah1 and Ahmad R. Sharafat2,*

1 Department of IT and Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran
2 Department of Electrical and Computer Engineering, Tarbiat Modares University, Tehran, Iran

* Corresponding author: sharafat{at}isc.iranet.net

Received 27 May 2006; revised 28 December 2006

The problem of service availability is analyzed using the model developed in Part I. It is shown that the general service availability problem is undecidable, i.e. there is no single algorithm to determine whether a given service in a given system is available at a given time. In restricted cases, it is shown that the problem is decidable, but is NP-complete. The problem of service availability is then extended to nondeterministic systems. Finally, it is shown that a number of important cases can be studied in a cohesive manner based on our proposed formalism.

Key Words: decidability • non-deterministic systems • NP-completeness • service availability


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.