大葉大學圖書館 |

A polynomial translation of mobile ambients into safe petri nets[electronic resource] :understanding a calculus of hierarchical protection domains /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	004.0151
書名/作者:	A polynomial translation of mobile ambients into safe petri nets : understanding a calculus of hierarchical protection domains // by Susanne Gobel.
作者:	Gobel, Susanne.
出版者:	Wiesbaden : : Springer Fachmedien Wiesbaden :, 2016.
面頁冊數:	ix, 66 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Petri nets.
標題:	Computer science - Mathematics.
標題:	Computer Science.
標題:	Logics and Meanings of Programs.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Computer Systems Organization and Communication Networks.
ISBN:	9783658117658
ISBN:	9783658117641
內容註:	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 Gobel 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 Gobel 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.
電子資源:	http://dx.doi.org/10.1007/978-3-658-11765-8

A polynomial translation of mobile ambients into safe petri nets[electronic resource] :understanding a calculus of hierarchical protection domains /
Gobel, Susanne.

A polynomial translation of mobile ambients into safe petri netsunderstanding a calculus of hierarchical protection domains /[electronic resource] :by Susanne Gobel. - Wiesbaden :Springer Fachmedien Wiesbaden :2016. - ix, 66 p. :ill., digital ;24 cm. - BestMasters. - 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 Gobel 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 Gobel 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:

481777
Petri nets.

LC Class. No.: QA267

Dewey Class. No.: 004.0151

A polynomial translation of mobile ambients into safe petri nets[electronic resource] :understanding a calculus of hierarchical protection domains /
LDR:02872nam a2200349 a 4500 001 456044
003 DE-He213
005 20160817105625.0
006 m d
007 cr nn 008maaau
008 161227s2016 gw s 0 eng d
020 $a 9783658117658 $q (electronic bk.)
020 $a 9783658117641 $q (paper)
024 7 $a 10.1007/978-3-658-11765-8 $2 doi
035 $a 978-3-658-11765-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA267 $b .G574 2016
100 1 $a Gobel, Susanne. $3 654933
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 Gobel.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2016.
300 $a ix, 66 p. : $b ill., digital ; $c 24 cm.
490 1 $a BestMasters
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 Gobel 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 Gobel 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 Petri nets. $3 481777
650 0 $a Computer science $x Mathematics. $3 382369
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Logics and Meanings of Programs. $3 466905
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Computer Systems Organization and Communication Networks. $3 463914
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a BestMasters. $3 602104
856 4 0 $u http://dx.doi.org/10.1007/978-3-658-11765-8
950 $a Computer Science (Springer-11645)