- We will send in 10–14 business days.
/images/books/13225760/9783658117641.jpg)
- Author: Susanne Göbel
- Publisher: Springer Vieweg
- Year: 2016
- Pages: 66
- ISBN-10: 3658117648
- ISBN-13: 9783658117641
- Format: 14.8 x 21 x 0.5 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
A Polynomial Translation of Mobile Ambients Into Safe Petri Nets (e-book) (used book) | bookbook.eu
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.09:20:10
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Susanne Göbel
- Publisher: Springer Vieweg
- Year: 2016
- Pages: 66
- ISBN-10: 3658117648
- ISBN-13: 9783658117641
- Format: 14.8 x 21 x 0.5 cm, minkšti viršeliai
- Language: English English
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