Modelling and verifying mobile systems using p-graphs

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

Volumn 5404 LNCS, Issue , 2009, Pages 437-448

  Peschanski, Frédéric ^a   Bialkiewicz, Joël Alexis ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; ENCODING/DECODING; GRAPH REWRITING; GRAPHICAL MODEL; MOBILE INTERACTION; MOBILE SYSTEMS; NEW OPPORTUNITIES; OPERATIONAL SEMANTICS; P-GRAPHS; RATE OF INTERACTIONS; TRANSITION NETS; VERIFICATION ALGORITHMS;

GRAPHIC METHODS;

COMPUTER SCIENCE;

EID: 67650704868     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-95891-8_40     Document Type: Conference Paper

References (16)

1. Milner, R.: Communicating and Mobile Systems: The p-Calculus. Cambridge University Press, Cambridge (1999)
2. Milner, R.: Pi-nets: A graphical form of pi-calculus. In: Sannella, D. (ed.) ESOP 1994. LNCS, vol.788, pp. 26-42. Springer, Heidelberg (1994)
3. Parrow, J.: Interaction diagrams. Nord. J. Comput. 2, 407-443 (1995)
4. Gadducci, F., Montanari, U.: Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.3838, pp. 106-126. Springer, Heidelberg (2005) (Pubitemid 350259086)
5. Laneve, C., Parrow, J., Victor, B.: Solo diagrams. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.2215, pp. 127-144. Springer, Heidelberg (2001) (Pubitemid 33359689)
6. Gadducci, F.: Graph rewriting for the p-calculus. Mathematical Structures in Computer Science 17, 407-437 (2007)
7. Victor, B., Moller, F.: The mobility workbench - a tool for the pi-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.818, pp. 428-440. Springer, Heidelberg (1994)
8. Pistore, M., Sangiorgi, D.: A partition refinement algorithm for the p-calculus. Inf. Comput. 164, 264-321 (2001)
9. Peschanski, F.: A tutorial on p-graphs: diagrams of mobile interactions. Technical report, LIP6 - UPMC Paris Universitas (2008), http://www-poleia.lip6. fr/~pesch/pigraphs
10. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 558-565 (1978) (Pubitemid 8615486)
11. Löwe, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109, 181-224 (1993) (Pubitemid 23639485)
12. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973-989 (1987)
13. Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformation: volume I. foundations. World Scientific Publishing Co., Inc., River Edge (1997)
14. Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: Verifying mobile processes in the hal environment. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.1427, pp. 511-515. Springer, Heidelberg (1998) (Pubitemid 128092366)
15. Devillers, R.R., Klaudel, H., Koutny, M.: Modelling mobility in high-level petri nets. In: ACSD, pp. 110-119. IEEE Computer Society, Los Alamitos (2007)
16. Montanari, U., Pistore, M.: pi-calculus, structured coalgebras, and minimal hdautomata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.1893, pp. 569-578. Springer, Heidelberg (2000)