A Petri Net Interpretation of Open Reconfigurable Systems

• Autorzy: Peschanski F. , Klaudel H. , Devillers R.
• Języki publikacji: EN

Abstrakty

EN

We present a Petri net interpretation of the pi-graphs - a graphical variant of the picalculus where recursion and replication are replaced by iteration. The concise and syntax-driven translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated high-level Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the translated Petri nets, most notably a guarantee of finiteness by construction.

Słowa kluczowe

EN

reconfigurable systems; pi-calculus; iteration; Petri nets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2013
• Tom: Vol. 122, nr 1-2
• Strony: 85--117
• Opis fizyczny: Bibliogr. 14 poz., rys., tab., wykr.

Twórcy

autor

Peschanski F.

• LIP6 – Université Pierre et Marie Curie, Paris, France

autor

Klaudel H.

• IBISC – Université d’Évry-Val-d’Essonne, Évry, France

autor

Devillers R.

• QUALSEC – Université Libre de Bruxelles, Belgium

Bibliografia

• [1] Milner, R.: Communicating and Mobile Systems: The -Calculus. Cambridge University Press (1999)
• [2] Peschanski, F., Bialkiewicz, J.A.: Modelling and verifying mobile systems using pi-graphs. In: SOFSEM. Volume 5404 of LNCS., Springer (2009) 437–448
• [3] Peschanski, F., Klaudel, H., Devillers, R.: A decidable characterization of a graphical pi-calculus with iterators. In: Infinity. Volume 39 of EPTCS. (2010) 47–61
• [4] Best, E., Devillers, R., Koutny,M.: Petri Net Algebra. EATCS Monographs in Theoretical Computer Science. Springer (2001)
• [5] Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: ICALP. Volume 3142 of LNCS., Springer (2004) 307–319
• [6] Busi, N., Gorrieri, R.: A Petri net semantics for -calculus. In: CONCUR. Volume 962 of LNCS., Springer (1995) 145–159
• [7] Busi, N., Gorrieri, R.: Distributed semantics for the pi-calculus based on Petri nets with inhibitor arcs. J. Log. Algebr. Program. 78 (2009) 138–162
• [8] Meyer, R., Gorrieri, R.: On the relationship between -calculus and finite place/transition Petri nets. In: CONCUR. Volume 5710 of LNCS., Springer (2009) 463–480
• [9] Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general -calculus terms. Formal Asp. Comput. 20 (2008) 429–450
• [10] Berger,M.: An interview with Robin Milner. http://www.informatics.sussex.ac.uk/users/mfb21/interviews/milner/ (2003)
• [11] Peschanski, F., Klaudel, H., Devillers, R.: A Petri net interpretation of open reconfigurable systems. In: Proceedings ATPN’2011. Volume 6709 of LNCS., Springer (2011) 208–227
• [12] Degano, P., Priami, C.: Causality for mobile processes. In: ICALP. Volume 944 of LNCS., Springer (1995) 660–671
• [13] Sangiori, D.,Walker, D.: The -calculus: a Theory of Mobile Processes. Cambridge University Press (2001)
• [14] Montanari, U., Pistore,M.: History-dependent automata: An introduction. In: SFM. Volume 3465 of LNCS., Springer (2005) 1–28