Analysing Petri Nets in a Calculus of Context-Aware Ambients

This paper proposes an approach to analysing and verifying Petri nets using a Calculus of Context-aware Ambients (CCA). We propose an algorithm that transforms a Petri net into a CCA process, which can then be analysed and verified using the CCA verification tools. Besides, this demonstrates that CCA is at least as expressive as Petri nets. We illustrate the practicality of our approach using a case study of the dining cryptographers problem.

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

[2]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[3]  R. Gorrieri.  A Petri Net Semantics for -calculus ? , 1995 .

[4]  Antonio Cerone,et al.  Implementing Condition/Event Nets in the Circal Process Algebra , 2002, FASE.

[5]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[6]  Victor Khomenko,et al.  Modelling and Analysis Mobile Systems Using \pi -calculus (EFCP) , 2015, Trans. Petri Nets Other Model. Concurr..

[7]  Rocco De Nicola,et al.  A distributed operational semantics for CCS based on condition/event systems , 1988, Acta Informatica.

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

[9]  Hussein Zedan,et al.  The Calculus of Context-aware Ambients , 2011, J. Comput. Syst. Sci..

[10]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[11]  Alexander K. Petrenko,et al.  Electronic Notes in Theoretical Computer Science , 2009 .

[12]  Maciej Koutny,et al.  Operational Semantics for the Petri Box Calculus , 1994, CONCUR.

[13]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[14]  Robin Milner,et al.  Transition systems, link graphs and Petri nets , 2006, Mathematical Structures in Computer Science.

[15]  C. Petri.  Kommunikation mit Automaten , 1962 .

[16]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[17]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[18]  Laurent Mazare,et al.  Using Unification For Opacity Properties , 2004 .

[19]  Ursula Goltz.  CCS and Petri Nets , 1990, Semantics of Systems of Concurrent Processes.

[20]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[21]  Roland Meyer,et al.  A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets , 2013, Log. Methods Comput. Sci..

[22]  Vladimiro Sassone,et al.  A Congruence for Petri Nets , 2005, PNGT@ICGT.

[23]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.

[24]  Robin Milner,et al.  Bigraphs for Petri Nets , 2003, Lectures on Concurrency and Petri Nets.