Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets

  • Fernando Rosa-Velardo
  • David de Frutos-Escrig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4218)


We study Mobile Synchronizing Petri Nets (MSPN), that allow the description of systems composed of a collection of interacting mobile components. Unlike in other models of modular or mobile Petri Nets, we focus on security issues. For that purpose, we introduce a fresh name generation mechanism to provide special authentication tokens. These names are treated in an abstract way, which allows us to retain the decidability of some properties that hold for Place/Transition nets (P/T nets). In this paper, we are interested in checking that the desired security properties of a system still hold, even when in an arbitrary malicious environment. However, since we are dealing with security properties, we must regard that some names of the system are assumed to be secret, which restricts the set of possible environments. We develop a symbolic semantics that takes into account the behaviour of any of those environments, though in an abstract way. We establish the desired relations between the original and the symbolic semantics to conclude that the latter is correct and complete with respect to the former.


Ubiquitous Computing Security Property Open Trace Movement Transition Singleton Colour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asperti, A., Busi, N.: Mobile Petri Nets. Technical Report UBLCS-96-10, University of Bologna (1996)Google Scholar
  2. 2.
    Aziz Abdulla, P., Cerans, K., Jonsson, B.: Algorithmic Analysis of Programs with Well Quasi-Ordered Domains. Inf. Comput. 160(1-2), 109–127 (2000)MATHCrossRefGoogle Scholar
  3. 3.
    Bednarczyk, M.A., Bernardinello, L., Pawlowski, W., Pomello, L.: Modelling Mobility with Petri Hypernets. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri Nets based on deterministic processes. Mathematical Structures in Computer Science 15(1), 1–35 (2005)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Christensen, S., Hansen, N.D.: Coloured Petri Nets Extended with Channels for Synchronous Communication. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 159–178. Springer, Heidelberg (1994)Google Scholar
  7. 7.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: The Maude 2.0 System. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 76–87. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Johnen, C.: Decidability of Home Space Property. Petri Net Newsletter(29) (1988)Google Scholar
  9. 9.
    Kindler, E.: A Compositional Partial Order Semantics for Petri Net Components. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 159–178. Springer, Heidelberg (1994)Google Scholar
  10. 10.
    Lomazova, I.A.: Nested Petri Nets; Multi-level and Recursive Systems. Fundamenta Informaticae 47, 283–293 (2002)MathSciNetGoogle Scholar
  11. 11.
    Jensen, K.: Coloured Petri Nets.Basic Concepts, Analysis Methods and Practical Use. In: Basic Concepts. Monographs in Theor. Comp. Science, vol. 1, Springer, Heidelberg (1997)Google Scholar
  12. 12.
    Lakos, C.: A Petri Net View of Mobility. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 174–188. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Milner, R.: Theories for the Global Ubiquitous Computer. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 5–11. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  14. 14.
    Rosa-Velardo, F., Marroquín-Alonso, O., de Frutos-Escrig, D.: Mobile Synchronizing Petri Nets: a choreographic approach for coordination in Ubiquitous Systems. In: MTCoord 2005. ENTCS, vol. 150(1), Elsevier, Amsterdam (2006)Google Scholar
  15. 15.
    Rosa-Velardo, F., de Frutos-Escrig, D., Marroquín-Alonso, O.: On the expressiveness of Mobile Synchronizing Petri Nets. In: 3rd Int. Workshop on Security Issues in Concurrency, SecCo 2005. ENTCS (to appear, 2005)
  16. 16.
    Rosa-Velardo, F., Segura-Díaz, C., de Frutos-Escrig, D.: Tagged systems: a framework for the specification of history dependent properties. ENTCS, vol. 137(1). Elsevier, Amsterdam (2005)Google Scholar
  17. 17.
    Rosa-Velardo, F., Frutos-Escrig, D.: Deciding Coverability in Open Petri Net Systems (submitted)
  18. 18.
    Rosa-Velardo, F.: Coding Mobile Synchronizing Petri Nets into Rewriting Logic. In: 7th International Workshop on Rule-Based Programming, RULE 2006. ENTCS (to appear)
  19. 19.
    Stajano, F.: Security for Ubiquitous Computing. Wiley Series in Communications Networking & Distributed Systems. John Wiley & Sons, Chichester (2002)CrossRefGoogle Scholar
  20. 20.
    Valk, R.: Petri Nets as Token Objects: An Introduction to Elementary Object Nets. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 1–25. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  21. 21.
    Weiser, M.: Some Computer Science Issues in Ubiquitous Computing. Comm. of the ACM 36(7), 74–84 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Fernando Rosa-Velardo
    • 1
  • David de Frutos-Escrig
    • 1
  1. 1.Dpto. de Sistemas Informáticos y ProgramaciónUniversidad Complutense de Madrid 

Personalised recommendations