A Polynomial Translation of Mobile Ambients into Safe Petri Nets: Understanding a Calculus of Hierarchical Protection Domains

by Susanne Gïbel

Overview

The master thesis of Susanne Göbel generates the deep understanding of the Mobile Ambient (MA) calculus that is necessary to use it as a modeling language. Instead of calculus terms a much more convenient representation via MA trees naturally maps to the application area of networks where processes pass hierarchical protection domains like firewalls. The work analyses MA’s function principles and derives a translation into Safe Petri nets. It extends to arbitrary MA processes but finiteness of the net and therefore decidability of reachability is only guaranteed for bounded processes. The construction is polynomial in process size and bounds so that reachability analysis is only PSPACE-complete.

Product Details

ISBN-13:	9783658117641
Publisher:	Springer Fachmedien Wiesbaden
Publication date:	01/23/2016
Series:	BestMasters
Edition description:	1st ed. 2016
Pages:	66
Product dimensions:	5.83(w) x 8.27(h) x (d)

About the Author

Susanne Göbel currently works towards her PhD in Computer Science at the University of Kaiserslautern. She engages in various research projects to help people understand computational frameworks of theory and practice. While devoting most of her free time to her family she still finds time to work as women councilor and on improving studying and working conditions in the faculty.

Table of Contents

Translating Mobile Ambient (MA) Processes into Safe Petri Nets - The Idea.- Managing Names in the Petri Net.- Translating Mobile Ambient Processes into Safe Petri Nets – Complete Construction.- From MA to rMA.- From rMA to MA-PN.- Polynomial Construction Using a Substitution Net.