113,29 €
A Polynomial Translation of Mobile Ambients into Safe Petri Nets
A Polynomial Translation of Mobile Ambients into Safe Petri Nets
  • Sold out
A Polynomial Translation of Mobile Ambients into Safe Petri Nets
A Polynomial Translation of Mobile Ambients into Safe Petri Nets
El. knyga:
113,29 €
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…
0

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.

113,29 €
Log in and for this item
you will receive
1,13 Book Euros! ?

Electronic book:
Delivery after ordering is instant! Intended for reading only on a computer, tablet or other electronic device.

Lowest price in 30 days: 113,29 €

Lowest price recorded: Price has not changed


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

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)