¡Nos trasladamos! E-Prints cerrará el 7 de junio.

En las próximas semanas vamos a migrar nuestro repositorio a una nueva plataforma con muchas funcionalidades nuevas. En esta migración las fechas clave del proceso son las siguientes:

Es muy importante que cualquier depósito se realice en E-Prints Complutense antes del 7 de junio. En caso de urgencia para realizar un depósito, se puede comunicar a docta@ucm.es.

On the Expressiveness of Mobile Synchronizing Petri Nets



Downloads per month over past year

Rosa Velardo, Fernando and Frutos Escrig, David de and Marroquín Alonso, Olga (2007) On the Expressiveness of Mobile Synchronizing Petri Nets. Electronic Notes in Theoretical Computer Science, 180 (1). pp. 77-94. ISSN 15710661

[thumbnail of Frutos21springer.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/article/pii/S1571066107003167


In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a collection of (possibly mobile) hardware devices and mobile agents, both modelled in a homogenous way and abstracting from middleware details. Our basic model introduced a colour to describe localities, but still lacked appropriate primitives to deal with security, and in fact it was equivalent to P/T nets. Then, we introduced the primitives to cope with security: a new colour for identifiers, basically corresponding to the natural numbers, that are created by means of a special transition. This mechanism allows us to deal with authentication issues. In this paper we discuss the expressiveness of the extended model with the authentication primitives. More specifically, we study several instances of the classical reachability and coverability problems. Finally, we also study a more abstract version of the mechanism to create identifiers, using abstract names, close to those in the π-calculus or the Ambient Calculus. We have proved that both models are strictly in between P/T nets and Turing machines.

Item Type:Article
Uncontrolled Keywords:Mobility; Petri nets; security; expressiveness
Subjects:Sciences > Computer science
ID Code:20740
Deposited On:10 Apr 2013 09:03
Last Modified:31 Aug 2018 10:20

Origin of downloads

Repository Staff Only: item control page