Journal of Software - Academy Publisher

More documents

Recommendations

Info

768 JOURNAL OF SOFTWARE, VOL. 6, NO. 5, MAY 2011 [186] M. Vigder, Applying Formal Techniques to the Design of Concurrent Systems. Ph.D. thesis, SCE Dept., Carleton University, Canada, July 1992. [187] M. Vinje, An Auditing Framework for Service Provision in Mobile IPv6 Networks. Diploma Thesis, EPF Zurich, Switzerland, August 2002. [188] M. Weiss, “Pattern-Driven Design of Agent Systems: Approach and Case Study”, in 15th Conf. on Advanced Information Systems Engineering (CAiSE'03), LNCS 2681, Springer, pp. 711–723, June 2003. doi:10.1007/3- 540-45017-3 [189] M. Weiss, “More Patterns for Web Applications”, in Tenth European Conf. on Pattern Languages of Programs (Euro PLoP 2005), Irsee, Germany, pp. 21–34, July 2005. [190] M. Weiss and D. Amyot, “Business process modeling with URN,” Int. J. of E-Business Research, 1(3), pp. 63– 90, 2005. doi:10.4018/jebr.2005070104 [191] M. Weiss and B. Esfandiari, “On Feature Interactions among Web Services”. Int. J. of Web Services Research, 2(4) pp. 22–47, October 2005. doi:10.4018/jwsr. 2005100102 [192] M. Weiss, B. Esfandiari, and Y. Luo, “Towards a classification of Web service feature interactions”. Computer Networks, 51(2), Elsevier, pp. 359–381, February 2007. doi:10.1016/j.comnet.2006.08.003 [193] M. Weiss and H. Mouratidis, “Selecting Security Patterns that Fulfill Security Requirements”, in 16th IEEE Int. Requirements Engineering Conf. (RE'08), IEEE CS, pp. 169–172, September 2008. doi:10.1109/RE.2008.32 [194] P. Wu and C.M. Woodside, “An Aggregation Approach to Constructing Hybrid Layered Queueing Models”, in 7th Int. Workshop on Performability Modeling of Computer and Communication Systems (PMCCS7), Torino, Italy, September 2005. [195] W. Wu and T.P. Kelly, “Managing Architectural Design Decisions for Safety-Critical Software Systems”, in 2nd Int. Conf. on the Quality of Software Architectures (QoSA 2006), LNCS 4126, Springer, pp. 59–77, June 2006. doi:10.1007/11921998_9 [196] Z. Yi, CNAP Specification and Validation: A Design Methodology Using LOTOS and UCM. M.Sc. thesis, SITE, University of Ottawa, Canada, January 2000. [197] E.S.-K. Yu, Modelling strategic relationships for process reengineering. Ph.D. thesis, Dept. of Computer Science, University of Toronto, Canada, 1995. [198] E. Yu, Y. Yu, and L. Liu, OME — Organization Modelling Environment, University of Toronto, 2000. http://www.cs.toronto.edu/km/ome/ [199] X.Y. Zeng, Transforming Use Case Maps to the Core Scenario Model Representation. M.Sc. thesis, SITE, University of Ottawa, Canada, June 2005 [200] R. Zhang and X.-X. Liu, “Feature Interaction Filtering Method Based on URN (基于 URN 的特征冲突过滤方法)”, Computer Engineering (计算机工程), 35(21), pp. 45–47, November 2009. © 2011 ACADEMY PUBLISHER Daniel Amyot received both his Ph.D. (2001) and M.Sc. (1994) degrees in computer science from the University of Ottawa. The research topic was related to the specification and validation of telecommunication systems with Use Case Maps and LOTOS. After working for Mitel Networks as a senior researcher, he joined the School of Information Technology and Engineering of the University of Ottawa, where he is now Associate Professor in software engineering. His research interests include goal-oriented and scenario-based software engineering, requirements engineering, business process modeling, aspect-oriented modeling, and healthcare informatics. He has published over 90 papers in various conferences and in journals such as Requirements Engineering, Computer Networks, and the International Journal of Electronic Business. Dr. Amyot is a member of ACM, IEEE Computer Society, and APIIQ, and he is a professional engineer in the province of Québec (Canada). He is also Associate Rapporteur for requirements languages at the International Telecommunication Union, where he leads the evolution of the User Requirements Notation. Gunter Mussbacher received a M.Sc. degree in computer science from Simon Fraser University in 1999, and a Ph.D. in computer science from the University of Ottawa in 2010. In his thesis, he developed the Aspect-oriented User Requirements Notation (AoURN), a framework that enables goal-oriented, scenario-based, and aspect-oriented modeling in a unified way. After his M.Sc., he worked as a research engineer for the Strategic Technology department of Mitel Networks, where he applied and taught URN concepts. He has published in the Requirements Engineering Journal (REJ) and in the Transactions on Aspect-Oriented Software Development (TAOSD), and co-edited with Daniel Amyot the URN standard (ITU Recommendation Z.151 11/2008). He is also teaching software engineering undergraduate courses as well as URN and AoURN tutorials for industry and at international conferences. His general research interests lie in requirements engineering, URN, aspect-oriented modeling, and patterns. Dr. Mussbacher is an organizer and program committee member of Early Aspects (EA), Aspect-oriented Modeling (AOM), and Systems Analysis and Modelling (SAM) workshops since 2008.
JOURNAL OF SOFTWARE, VOL. 6, NO. 5, MAY 2011 769 Stochastic Process Algebra with Value-Passing and Weak Time Restrictions Guang Zheng 1,2 , Jinzhao Wu 3,4 , and Aiping Lu 2,∗ 1 Information Science and Engineering School, Lanzhou University, Lanzhou 730000, China, Email: forzhengguang@163.com 2 Institute of Basic Research in Clinical Medicine, China Academy of Chinese Medical Sciences, Dongzhimen, Beijing 100700, China 3 Guangxi University for Nationalities, China Academy of Chinese Medical Sciences, Nanning, 530004, China 4 School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China ∗ Corresponding author: lap64067611@126.com Abstract— Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., YAWN ) enhances the process algebra with stochastic extensions which is perfect to analyze phenomena of process with executing durations in the real world. What’s more, in system runs, value passing is tightly bounded with their processes. However, stochastic process algebras lack value passing can limit their expressiveness. Based on this, we propose a process algebra of stochastic process algebra with value passing. This new process algebra can specify the behaviors of systems in a more clear and accurate way. In dealing with relationship of bisimulations, we introduce a new policy of weak time comparison between processes in bisimulation which is more convenient and doable in practice. Index Terms— stochastic process algebra, value passing, equivalence, bisimulation, weak time restriction. I. INTRODUCTION Process algebra is a widely accepted language of specifying distributed and concurrent systems. The fundamental work is done by Milner in CCS [23], Hoare in CSP [13] and Hilston in ACP [2]. Stochastic Process Algebras (SPAs) [3], [6], [7], [16], [18] have been invented in the early 90’s, the main idea of stochastic process algebras is to incorporate quantitative information in a qualitative process algebra model. In these approaches proposed so far, the quantitative information is given in terms of distribution functions or random variables. These variables denote the duration of actions, and these durations are specified together with actions. The basic activity of a process is action. In stochastic process algebras, actions are equipped with stochastic distribution functions which describes the execution time of the actions stochastically. SPAs are suitable to describe This work was partially supported by the National Eleventh Five Year Support Project of China (2006BAI04A10), the Innovative Methodology Project supported by MOST of China(2008IM020900, 2009ZX09502- 019). National Science Foundation of China (No. 30902003, 30973975, 90709007, and 81072982). © 2011 ACADEMY PUBLISHER doi:10.4304/jsw.6.5.769-782 functional as well as stochastic behaviors in one single specification. The actions in SPA give the framework specification of system’s behaviors. During the execution of SPAs, value passing occurs intuitively and naturally. Processes cooperate with each other by exchanging messages [10], [11], [27], it can be happened in typical operators like: • Sequential composition, where the prefix action might pass the value to the following action for further execution. This happens commonly in programs; • Parallel composition, where a synchronous communication event can be executed. This is the type of communication in SPAs; • Recursive operation, this operator is useful in dealing with repeated actions with certain rules. SPAs can be models for describing phenomena of the real world in an abstract level. Value passing can enhance SPAs with the abilities to describing phenomena in a more detailed level, more intuitive to understand and more doable to put into use. This can be demonstrated by the above examples. In other systems, (for example, traffic control, weather forecasting, scientific calculation, and stock markets), there are values passing with all processes running all time long. Value passing exists at any moment in system runs. With value passing, we can get a inner sight into the phenomena (e.g., under certain situation, values are final results). So, it is necessary and intuitively for us to equip the language of SPAs with value passing. By doing this, we can get a better understanding of the phenomena described in SPAs. The main idea of SPA with value passing is to enhance actions with notions of duration and value passing during their executions. Durations are described stochastically by means of distribution functions. Values passing during executions can simulate the key parameters in system runs. In Markovian SPA, only exponential distributions are considered as delay parameters. As for value passing, we assume that only valid values are permitted during the execution, and the invalid values will trigger an exception.
Page 1 and 2: Journal of Software ISSN 1796-217X
Page 3 and 4: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
Page 23: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
Page 82 and 83:
826 JOURNAL OF SOFTWARE, VOL. 6, NO
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 97 and 98:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Aims and Scope. Call for Papers and
show all

Journal of Software - Academy Publisher

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?