Abstract
As weakness exists in describing behaviors and mobility in Petri Net theory, we put forward a mode using pi calculus to describe the gird computing, and present its simulation and verification. We briefly introduce the pi calculus at first. Then, it is drawn in detail how to outline single node computing and grid computing by pi calculus: it can be described as a two-player game. The first player moves the first token from the node to a neighboring node along an outgoing edge. On the other hand, the second player can respond only by moving the other token from the node it is on to adjacent node along an outgoing edge. It can be defined the winning mechanism which is related to the relation of the two computing ways: strong bi-simulation, weak simulation or reduction simulation. Many properties (such as deadlock or mutual exclusion violation) may be checked in this fashion. At last an example scenario is presented.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Y.J. Lee and P. Henderson, A Practical Modelling Notation for Secure Distributed Computation, Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA’05), pp. 439–442, 2005.
A. Paschke and M. Bichler, SLA Representation, Management and Enforcement, Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, 2005.
Z.Y. Xia and Y.C. Jiang, A Novel Grid Node-by-Node, GCC 2004, LNCS 3251, pp. 356–363, 2004.
M. Ragni, An Arrangement Calculus, Its Complexity, and Algorithmic Properties, KI 2003, LNAI 2821, pp. 580–590, 2003.
C.L. Weng, X.D. Lu, and Q.N. Deng, Formalizing Service Publication and Discovery in Grid Computing Systems, GCC 2003, LNCS 3032, pp.669–676, 2004.
Z.W. Qi, C. Fu, D.Y. Shi, J.Y. You, and M.L. Li, Membrane Calculus: A Formal Method for Grid Transactions, GCC 2004, LNCS 3251, pp.73–80, 2004.
R. Milner, Communication and Concurrency (International Series in Computer Science, Prentice Hall, 1989).
R. Milner, Communicating and Mobile Systems: the π-Calculus (Cambridge 1999).
R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes, Part I and Part II. Information and Computation 100(1), 1–77 (1992).
C. A. R. Hoare, Communicating Sequential Processes (Prentice-Hall, 1984).
W.M.P Van der Aalst, Structural Characterizations of Sound Workflow Nets, Technical Reports, 96/23, Eindhoven: Eindhoven University of Technology, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Hu, T., Chen, S., Lin, W. (2006). Grid Computing Simulation and Verification Based on pi Calculus. In: Tjoa, A.M., Xu, L., Chaudhry, S.S. (eds) Research and Practical Issues of Enterprise Information Systems. IFIP International Federation for Information Processing, vol 205. Springer, Boston, MA. https://doi.org/10.1007/0-387-34456-X_13
Download citation
DOI: https://doi.org/10.1007/0-387-34456-X_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34345-7
Online ISBN: 978-0-387-34456-0
eBook Packages: Computer ScienceComputer Science (R0)