Analysing Petri Nets in a Calculus of Context-Aware Ambients (original) (raw)

Abstract

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. This demonstrates that any system that can be specified in Petri nets can also be specified in CCA. Besides, the system can be analysed and verified using the CCA verification tools. We illustrate the practicality of our approach using a case study of the dining cryptographers problem.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (22)

  1. C.A. Petri, "Kommunikation mit Automaten," Ph.D. thesis, Fakultät für Mathematik und Physik, Technische Hochschule Darmstadt, Darmstadt, Germany, 1962.
  2. C.A.R Hoare, "Communicating Sequential Processes," Prentice-Hall, Inc., USA, 1985.
  3. J. C. M. Baeten, "Procesalgebra : een formalisme voor parallelle, communicerende processen," Kluwer, Deventer, 1986
  4. R. Milner, "Communicating and Mobile Systems: The π-Calculus," Cambridge University Press, USA, 1999.
  5. F. Siewe, H. Zedan, A. Cau, "The Calculus of Context-aware Ambients", J. Comput. System Sci., 77(4), pp. 597-620, 2011.
  6. M.A. Marsan, G. Balbo, G. Conte, S. Donatelli, G. Franceschinis, "Modelling with generalized stochastic Petri Nets," Wiley Series on Parallel Computing, 1995.
  7. T. Murata, "Petri nets: Properties, analysis and applications," vol. 77(4). Proceedings of the IEEE, pp. 541-580, 1989.
  8. D. Chaum, "The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability," vol. 1(1). J. Cryptol., Springer-Verlag, Berlin, Heidelberg, pp. 65-75, 1988.
  9. L. Mazaré, "Using unification for opacity properties," In Proceedings of the Workshop on Issues in the Theory of Security (WITS '04), pp. 165-176, 2004.
  10. J. W. Bryans, M. Koutny, P. Y. A. Ryan, "Modelling Opacity Using Petri Nets," vol. 121. Electr. Notes Theor. Comput. Sci. Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (WISP 2004), pp. 101-115, 2005.
  11. E. Best, R. R. Devillers, J G. Hall, "The box calculus: a new causal algebra with multi-label communication," Advances in Petri Nets: The DEMON Project, 1992.
  12. M. Koutny, J. Esparza, E. Best, "Operational Semantics for the Petri Box Calculus," Proceedings of the Concurrency Theory, CONCUR '94, Springer-Verlag, pp. 210-225, 1994.
  13. A. Cerone, "Implementing Condition/Event Nets in the Circal Process Algebra," Proceedings of the 5th International Conference on Fundamen- tal Approaches to Software Engineering, FASE '02, Springer-Verlag, pp. 49-63, 2002.
  14. J. Leifer, R. Milner, "Transition systems, link graphs and Petri nets," vol. 16(6). Mathematical Structures in Computer Science, pp. 989-1047, 2006.
  15. R. Milner, J. Desel, W. Reisig, G. Rozenberg, "Bigraphs for Petri Nets," Lectures on Concurrency and Petri Nets: Advances in Petri Nets, Springer Berlin Heidelberg, 2004.
  16. V. Sassone, P. Sobociński, "A Congruence for Petri Nets," vol. 127(2). Electronic Notes in Theoretical Computer Science, Proceedings of the Workshop on Petri Nets and Graph Transformations (PNGT 2004), pp. 107-120, 2005.
  17. P. Degano, R. De Nicola, U. Montanari, "A distributed operational semantics for CCS based on condition/event systems," vol. 26. Acta Informatica, pp. 59-91, 1988.
  18. U. Goltz, "CCS and petri nets," Semantics of Systems of Concurrent Processes, Springer Berlin Heidelberg, pp. 334-357, 1990.
  19. N. Busi, R. Gorrieri, "A Petri net semantics for π-calculus," CONCUR '95: Concurrency Theory, Springer Berlin Heidelberg, pp. 145-159, 1995.
  20. V. Khomenko, R. Meyer, R. Hüchting, "A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets," vol. 9(3). Logical Methods in Computer Science, 2013.
  21. V. Khomenko, V. Germanos, "Modelling and Analysis Mobile Systems Using π-calculus (EFCP)," Transactions on Petri Nets and Other Models of Concurrency X, Springer Berlin Heidelberg, pp. 153-175, 2015.
  22. L. Cardelli and A. Gordon, "Mobile Ambients," Theoretical Computer Science, VOL. 240, pp. 177-213, 2000.