Abstract
Our work is motivated by practice in Peer-to-Peer networks and Object-Oriented systems where instantiation and dynamically reconfigurable interconnection are essential paradigms. For example, in a Peer-to-Peer network nodes can exchange data to complete tasks. Nodes can leave or join the network at any time. In Object-Oriented systems, an object can be uniquely identified and will communicate with other objects. In this paper we outline a formal framework which supports this kind of interaction so that the integrity of each active object or node is preserved, and so that we can reason about the overall behaviour of the system. The formal framework is based on a combination of the π-calculus and the B-Method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrial, J-R.: The B Book: Assigning Programs to Meaning, CUP (1996)
Bakhshi, R., Gurov, D.: Verification of Peer-to-Peer Algorithms: a Case Study. In: Proceedings of 2nd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord’06). ENTCS (2006)
Berger, M., Honda, K.: The Two-Phase Commitment Protocol in an Extended pi-Calculus. In: Proceedings of EXPRESS 2000. ENTCS, vol. 39(1) (2003)
Eng, K.L., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. IEEE Communications Surveys and Tutorials 7(2), 72–93 (2005)
Gay, S.J., Hole, M.J.: Types and Subtypes for Client-Server Interactions. In: Swierstra, S.D. (ed.) ESOP 1999 and ETAPS 1999. LNCS, vol. 1576, pp. 74–90. Springer, Heidelberg (1999)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Karkinsky, D.: Mobile B machines. PhD thesis, University of Surrey (2007)
Pierce, B.C., Sangiorgi, D.: Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science 6(5), 409–454 (1996)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. CUP (2001)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Kienzle, M.G., Shenoy, P.J. (eds.) Proceedings of Multimedia Computing and Networking 2002. SPIE, vol. 4673, pp. 156–170 (2002)
Schneider, S., Treharne, H.: CSP Theorems for Communicating B machines. Formal Aspects of Computing 17(4), 390–422 (2005)
Smith, G.: A Framework for Modelling and Analysing Mobile Systems. In: Australasian Computer Science Conference (ACSC), pp. 193–202 (2004)
Taguchi, K., Dong, J.S., Ciobanu, G.: Relating π-calculus to Object-Z. In: Bellini, P., Bohner, S., Steffen, B. (eds.) Proceedings of IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2004), pp. 97–106. IEEE Press, New York (2004)
Tang, X., Woodcock, J.: Towards Mobile Processes in Unifying Theories. In: SEFM 2004, pp. 44–55. IEEE Computer Society Press, Los Alamitos (2004)
Treharne, H., Schneider, S.: Using a Process Algebra to Control B OPERATIONS. In: IFM, pp. 437–456. Springer, Heidelberg (1999)
Treharne, H., Schneider, S., Bramble, M.: Composing Specifications using Communication. In: Bert, D., Bowen, J.P., King, S. (eds.) ZB 2003. LNCS, vol. 2651, pp. 58–78. Springer, Heidelberg (2003)
Welch, P., Barnes, F.: Communicating mobile processes: introducing occam-pi. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 175–210. Springer, Heidelberg (2005)
Woodcock, J.C.P., Cavalcanti, A.L.C.: A Concurrent Language for Refinement. In: 5th Irish Workshop on Formal Methods (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karkinsky, D., Schneider, S., Treharne, H. (2007). Combining Mobility with State. In: Davies, J., Gibbons, J. (eds) Integrated Formal Methods. IFM 2007. Lecture Notes in Computer Science, vol 4591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73210-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-73210-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73209-9
Online ISBN: 978-3-540-73210-5
eBook Packages: Computer ScienceComputer Science (R0)