Overview
- Master Thesis in Computer Science
- Includes supplementary material: sn.pub/extras
Part of the book series: BestMasters (BEST)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (4 chapters)
Keywords
About this book
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.
Reviews
Authors and Affiliations
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.
Bibliographic Information
Book Title: A Polynomial Translation of Mobile Ambients into Safe Petri Nets
Book Subtitle: Understanding a Calculus of Hierarchical Protection Domains
Authors: Susanne Göbel
Series Title: BestMasters
DOI: https://doi.org/10.1007/978-3-658-11765-8
Publisher: Springer Vieweg Wiesbaden
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Fachmedien Wiesbaden 2016
Softcover ISBN: 978-3-658-11764-1Published: 28 January 2016
eBook ISBN: 978-3-658-11765-8Published: 22 January 2016
Series ISSN: 2625-3577
Series E-ISSN: 2625-3615
Edition Number: 1
Number of Pages: IX, 66
Number of Illustrations: 15 illustrations in colour
Topics: Logics and Meanings of Programs, Algorithm Analysis and Problem Complexity, Computer Systems Organization and Communication Networks