Modelling and Analysis of Mobile Computing Systems: An Extended Petri Nets Formalism

In its basic version, Petri Nets are defined as fixed graphs, where the behaviour of the system is modelled as the marking of the graph which changes over time. This constraint makes the Petri Nets a poor tool to deal with reconfigurable systems as mobile computing systems, where the structure of the system can change as its behaviour, during time. Many extended Petri nets were proposed to deal with this weakness. The aim of this work is to present a new extension of Petri Nets, where the structure of the graph can be highly flexible. This flexibility gives a rich model with complex behaviours, not allowed in previous extensions. The second aim is to prove that even these behaviours are so complex; they can be translated into other low level models (as Coloured Petri Nets [21]) and so be analysed. This translation exploits Dynamic Petri Nets [11] as an intermediary representation between our model and Coloured Petri Nets.

[1]  Fernando Rosa-Velardo.  Coding Mobile Synchronizing Petri Nets into Rewriting Logic , 2007, Electron. Notes Theor. Comput. Sci..

[2]  Dianxiang Xu,et al.  Modeling mobile agent systems with high level Petri nets , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[3]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[4]  Kahloul Laid,et al.  Code mobility modeling: a temporal labeled reconfigurable nets , 2008 .

[5]  Rüdiger Valk,et al.  Petri Nets as Token Objects: An Introduction to Elementary Object Nets , 1998, ICATPN.

[6]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[7]  Irina A. Lomazova,et al.  Nested Petri Nets: Multi-level and Recursive Systems , 2001, Fundam. Informaticae.

[8]  Stephen Gilmore,et al.  PEPA nets: a structured performance modelling formalism , 2002, Perform. Evaluation.

[9]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[10]  Daniel Moldt,et al.  Modelling Mobility and Mobile Agents Using Nets within Nets , 2003, ICATPN.

[11]  Kahloul Laid,et al.  Coloured Reconfigurable Nets For Code Mobility Modeling , 2007 .

[12]  Rüdiger Valk.  Self-Modifying Nets, a Natural Extension of Petri Nets , 1978, ICALP.

[13]  Allaoua Chaoui,et al.  Code mobility modeling: a temporal labeled reconfigurable nets , 2008, MOBILWARE.

[14]  Anna Ingólfsdóttir,et al.  Over 30 years of process algebra : past, present and future , 2003 .

[15]  Luca Bernardinello,et al.  Modelling Mobility with Petri Hypernets , 2004, WADT.

[16]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[17]  Allaoua Chaoui,et al.  LRN / R-MAUDE BASED APPROACH FOR MODELING AND SIMULATION OF MOBILE CODE SYSTEMS , 2011 .

[18]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[19]  Cédric Fournet,et al.  The Join Calculus: A Language for Distributed Mobile Programming , 2000, APPSEM.

[20]  Eric Badouel,et al.  Reconfigurable Nets, a Class of High Level Petri Nets Supporting Dynamic Changes , 1998 .

[21]  Andrea Asperti,et al.  Mobile Petri nets , 2009, Mathematical Structures in Computer Science.

[22]  Vladimiro Sassone,et al.  High-Level Petri Nets as Type Theories in the Join Calculus , 2001, FoSSaCS.

[23]  Kurt Jensen,et al.  An Introduction to the Theoretical Aspects of Coloured Petri Nets , 1993, REX School/Symposium.

[24]  Rüdiger Valk,et al.  Object Petri Nets: Using the Nets-within-Nets Paradigm , 2003, Lectures on Concurrency and Petri Nets.

[25]  Fernando Rosa-Velardo,et al.  Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems , 2006, MTCoord@COORDINATION.