Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems

The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a long way ahead to become a pervasive reality. One of the reasons for this may be the lack of widely accepted formal models capable of capturing and analyzing the complexity of the new paradigm. We propose a simple Petri Net based model to study some of its main characteristics. We model both devices and software components as a special kind of coloured Petri Nets, located in locations, that can move to other locations and synchronize with other co-located nets, offering and requesting services. We obtain an amenable model for ubiquitous computing, due to its graphical representation. We present our proposal in a progressive way, first presenting a basic model where coordination is formalized by the synchronized firing of pairs of compatible transitions that offer and request a specific service, and ad hoc networks are modeled by constraining mobility by the dynamic acquisition of locality names. Next, we introduce a mechanism for the treatment of robust security properties, namely the generation of fresh private names, to be used for authentication properties.

[1]  Kurt Jensen,et al.  Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1 , 1996 .

[2]  David de Frutos-Escrig,et al.  Replicated Ambient Petri Nets , 2003, International Conference on Computational Science.

[3]  Irina A. Lomazova,et al.  Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets , 2002, Fundam. Informaticae.

[4]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[5]  Fernando Rosa-Velardo,et al.  Ubiquitous Systems and Petri Nets , 2005, ICCSA.

[6]  Rüdiger Valk,et al.  Concurrency in Communicating Object Petri Nets , 2001, Concurrent Object-Oriented Programming and Petri Nets.

[7]  Fernando Rosa-Velardo,et al.  On the Expressiveness of Mobile Synchronizing Petri Nets , 2007, SecCO@CONCUR.

[8]  Maciej Koutny,et al.  Petri Net Semantics of the Finite pi-calculus Terms , 2004, Fundam. Informaticae.

[9]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

[10]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[11]  Dirk Taubner,et al.  Representing CCS programs by finite predicate/transition nets , 1990, Acta Informatica.

[12]  Wolfgang Reisig,et al.  Place or Transition Petri Nets , 1996, Petri Nets.

[13]  Luca Cardelli,et al.  Mobility and Security , 2000 .

[14]  Roberto Gorrieri,et al.  A Petri Net Semantics for pi-Calculus , 1995, CONCUR.

[15]  Mark Weiser,et al.  Some computer science issues in ubiquitous computing , 1993, CACM.

[16]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 1998, Electron. Notes Theor. Comput. Sci..

[17]  Luca Cardelli,et al.  Types for the Ambient Calculus , 2002, Inf. Comput..

[18]  David de Frutos-Escrig,et al.  Ambient Petri nets , 2003, Electron. Notes Theor. Comput. Sci..

[19]  Allan Collins,et al.  Assessment and technology , 1993, CACM.

[20]  Mark Weiser The computer for the 21st century , 1991 .

[21]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[22]  David de Frutos-Escrig,et al.  Formal Techniques for Networked and Distributed Systems – FORTE 2004 , 2004, Lecture Notes in Computer Science.

[23]  Maciej Koutny,et al.  Petri Net Algebra , 2001, Monographs in Theoretical Computer Science An EATCS Series.