國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	A Polynomial Translation of Mobile Ambients into Safe Petri Nets/ by Susanne Göbel.
Reminder of title:	Understanding a Calculus of Hierarchical Protection Domains /
Author:	Göbel, Susanne.
Description:	IX, 66 p. 15 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer logic. -
Online resource:	https://doi.org/10.1007/978-3-658-11765-8
ISBN:	9783658117658

A Polynomial Translation of Mobile Ambients into Safe Petri Nets = Understanding a Calculus of Hierarchical Protection Domains /
Göbel, Susanne.

A Polynomial Translation of Mobile Ambients into Safe Petri NetsUnderstanding a Calculus of Hierarchical Protection Domains /[electronic resource] :by Susanne Göbel. - 1st ed. 2016. - IX, 66 p. 15 illus. in color.online resource. - BestMasters,2625-3577. - BestMasters,.

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. .

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. 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 Target Groups Students of Theoretical Computer Science and Verification Researchers in Verification of Process Calculi The Author Susanne Göbel currently works towards her PhD in Computer Science a t 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.

ISBN: 9783658117658

Standard No.: 10.1007/978-3-658-11765-8doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

A Polynomial Translation of Mobile Ambients into Safe Petri Nets = Understanding a Calculus of Hierarchical Protection Domains /
LDR:03206nam a22004095i 4500 001 979013
003 DE-He213
005 20200705035119.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783658117658 $9 978-3-658-11765-8
024 7 $a 10.1007/978-3-658-11765-8 $2 doi
035 $a 978-3-658-11765-8
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
100 1 $a Göbel, Susanne. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1272236
245 1 2 $a A Polynomial Translation of Mobile Ambients into Safe Petri Nets $h [electronic resource] : $b Understanding a Calculus of Hierarchical Protection Domains / $c by Susanne Göbel.
250 $a 1st ed. 2016.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2016.
300 $a IX, 66 p. 15 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a BestMasters, $x 2625-3577
505 0 $a 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. .
520 $a 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. 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 Target Groups Students of Theoretical Computer Science and Verification Researchers in Verification of Process Calculi The Author Susanne Göbel currently works towards her PhD in Computer Science a t 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.
650 0 $a Computer logic. $3 786340
650 0 $a Algorithms. $3 527865
650 0 $a Computer organization. $3 596298
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658117641
830 0 $a BestMasters, $x 2625-3577 $3 1253531
856 4 0 $u https://doi.org/10.1007/978-3-658-11765-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)