Formal approaches to deadlock analysis in competitions of shared web resources

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Competitions of shared web resources have been widely concerned today. Under the circumstances of networks, no central supervisor can be implemented, which makes it more complicated to avoid deadlock problems. This paper describes the interactions of web services and shared web resources using CSP method. Deadlocks can be analyzed based on the formal model.

Original languageEnglish
Title of host publicationProceedings - 2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009
Pages327-328
Number of pages2
DOIs
StatePublished - 2009
Event2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009 - Tianjin, China
Duration: 29 Jul 200931 Jul 2009

Publication series

NameProceedings - 2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009

Conference

Conference2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009
Country/TerritoryChina
CityTianjin
Period29/07/0931/07/09

Keywords

  • CSP
  • Deadlock
  • Shared web resources

Fingerprint

Dive into the research topics of 'Formal approaches to deadlock analysis in competitions of shared web resources'. Together they form a unique fingerprint.

Cite this