000 03640nam a22005535i 4500
001 978-3-658-11765-8
003 DE-He213
005 20200421112044.0
007 cr nn 008mamaa
008 160122s2016 gw | s |||| 0|eng d
020 _a9783658117658
_9978-3-658-11765-8
024 7 _a10.1007/978-3-658-11765-8
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aG�obel, Susanne.
_eauthor.
245 1 2 _aA Polynomial Translation of Mobile Ambients into Safe Petri Nets
_h[electronic resource] :
_bUnderstanding a Calculus of Hierarchical Protection Domains /
_cby Susanne G�obel.
250 _a1st ed. 2016.
264 1 _aWiesbaden :
_bSpringer Fachmedien Wiesbaden :
_bImprint: Springer Vieweg,
_c2016.
300 _aIX, 66 p. 15 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aBestMasters
505 0 _aTranslating 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 _aThe master thesis of Susanne G�obel 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�obel 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 _aComputer science.
650 0 _aComputer organization.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Systems Organization and Communication Networks.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783658117641
830 0 _aBestMasters
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-658-11765-8
912 _aZDB-2-SCS
942 _cEBK
999 _c56832
_d56832