Name
Abstract | ||
|---|---|---|
When Web services are used to coalesce around the distributed applications, one prominent solution to manage and coordinate Web services is the use of process management. Many researches have been done to deal with automatic discovery and composition issues of Web services. However, the problem of how to run a process that is composed of distributed services is seldom considered. In this paper, based on our previous work, the smart process-based application model (SPM), we formalize smart process (SP) using algebra CCS, and discuss the benefits. In particular, we propose goal-based algorithms to run Smart Process. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/CSCWD.2008.4537017 | CSCWD |
Keywords | Field | DocType |
distributed application,smart process-based application model(spm),smart process(sp),ccs,web services,distributed services,process management,smart processsp,smart process-based application modelspm,smart process-based application model,process algebra,computer science,software engineering,carbon capture and storage,application software,displays,web service,scanning probe microscopy,algebra,message passing | Services computing,Computer science,Business Process Execution Language,Web modeling,Web application security,Web service,Process calculus,WS-Policy,Distributed computing,Distributed services | Conference |
ISBN | Citations | PageRank |
978-1-4244-1651-6 | 1 | 0.37 |
References | Authors | |
9 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zongmin Shang | 1 | 1 | 1.05 |
| Haiyang Wang | 2 | 573 | 73.18 |
| Liqiang Wang | 3 | 703 | 56.71 |
| Hui Li | 4 | 1 | 1.05 |
| Yong-Quan Dong | 5 | 38 | 9.47 |