Equational reasoning on ad hoc networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5961 LNCS, Issue , 2010, Pages 113-128

  Ghassemi, Fatemeh ^a   Fokkink, Wan ^b   Movaghar, Ali ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; COMPLETE AXIOMATIZATIONS; EQUATIONAL REASONING; EQUATIONAL THEORY; NETWORK THEORY; PROCESS THEORY; RECURSIONS;

ALGEBRA; BROADCASTING; COMPUTER SOFTWARE; PERMANENT MAGNETS;

AD HOC NETWORKS;

EID: 77949475687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11623-0_6     Document Type: Conference Paper

References (13)

1. Baeten, J.C.M., Bergstra, J.A., Reniers, M.A.: Discrete time process algebra with silent step. In: Proof, language, and interaction: essays in honour of Robin Milner, pp. 535-569. MIT Press, Cambridge (2000)
2. Basten, T.: Branching bisimilarity is an equivalence indeed! Inf. Process. Lett. 58(3), 141-147 (1996)
3. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1-3), 109-137 (1984)
4. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science 37, 21-77 (1985)
5. Fokkink, W.J.: Introduction to Process Algebra. Springer, Heidelberg (2000)
6. Ghassemi, F., Fokkink, W.J., Movaghar, A.: Restricted broadcast process theory. In: Cerone, A., Gruner, S. (eds.) Proc. 6th Conference on Software Engineering and Formal Methods (SEFM 2008), pp. 345-354. IEEE, Los Alamitos (2008)
7. Ghassemi, F., Fokkink, W.J.,Movaghar, A.: Equational reasoning on ad hoc networks. Technical report, Sharif University of Technology (2009), http://mehr.sharif.edu/~fghassemi/Technical%20Report.pdf
8. Godskesen, J.C.: A calculus for mobile ad hoc networks. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 132-150. Springer, Heidelberg (2007)
9. Merro, M.: An observational theory for mobile ad hoc networks. In: Proc. 23rd Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIII). Electronic Notes in Theoretical Computer Science, vol. 173, pp. 275-293. Elsevier, Amsterdam (2007)
10. Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. In: Proc. 22nd Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXII). Electronic Notes in Theoretical Computer Science, vol. 158, pp. 331-353. Elsevier, Amsterdam (2006)
11. Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theoretical Computer Science 367(1), 203-227 (2006)
12. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 296-314. Springer, Heidelberg (2008)
13. van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555-600 (1996)