A Petri net interpretation of open reconfigurable systems

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

Volumn 6709 LNCS, Issue , 2011, Pages 208-227

  Peschanski, Frédéric ^a   Klaudel, Hanna ^b   Devillers, Raymond ^c  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITY OF EVRY   (France)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Petri nets; Pi calculus; Reconfigurable systems

Indexed keywords

CALCULATIONS; SEMANTICS;

LABELLED TRANSITION SYSTEMS; PI CALCULUS; RECONFIGURABLE SYSTEMS; SEMANTIC LEVELS;

PETRI NETS;

EID: 79960108431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21834-7_12     Document Type: Conference Paper

References (11)

1. Milner, R.: Communicating and Mobile Systems: The π-Calculus. Cambridge University Press, Cambridge (1999)
2. Busi, N., Gorrieri, R.: A Petri net semantics for π-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 145-159. Springer, Heidelberg (1995)
3. Busi, N., Gorrieri, R.: Distributed semantics for the pi-calculus based on Petri nets with inhibitor arcs. J. Log. Algebr. Program. 78, 138-162 (2009)
4. Meyer, R., Gorrieri, R.: On the relationship between π-calculus and finite place/Transition petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 463-480. Springer, Heidelberg (2009)
5. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general π-calculus terms. Formal Asp. Comput. 20, 429-450 (2008)
6. Berger, M.: An interview with Robin Milner, http://www.informatics. sussex.ac.uk/users/mfb21/interviews/milner/ (2003)
7. Peschanski, F., Bialkiewicz, J.-A.: Modelling and verifying mobile systems using π-graphs. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 437-448. Springer, Heidelberg (2009)
8. Peschanski, F., Klaudel, H., Devillers, R.: A decidable characterization of a graphical pi-calculus with iterators. In: Infinity. EPTCS, vol. 39, pp. 47-61 (2010)
9. Busi, N., Gabbrielli, M., Tennenholtz, M.: Comparing recursion, replication, and iteration in process calculi. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 307-319. Springer, Heidelberg (2004)
10. Degano, P., Priami, C.: Causality for mobile processes. In: Fülöp, Z. (ed.) ICALP 1995. LNCS, vol. 944, pp. 660-671. Springer, Heidelberg (1995)
11. Montanari, U., Pistore, M.: History-dependent automata: An introduction. In: Bernardo, M., Bogliolo, A. (eds.) SFM-Moby 2005. LNCS, vol. 3465, pp. 1-28. Springer, Heidelberg (2005)