000753459 000__ 03468cam\a2200469Ii\4500
000753459 001__ 753459
000753459 005__ 20230306141559.0
000753459 006__ m\\\\\o\\d\\\\\\\\
000753459 007__ cr\cn\nnnunnun
000753459 008__ 160126t20162016gw\a\\\\ob\\\\000\0\eng\d
000753459 020__ $$a9783658117658$$q(electronic book)
000753459 020__ $$a3658117656$$q(electronic book)
000753459 020__ $$z9783658117641
000753459 0247_ $$a10.1007/978-3-658-11765-8$$2doi
000753459 035__ $$aSP(OCoLC)ocn936040167
000753459 035__ $$aSP(OCoLC)936040167
000753459 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dYDXCP$$dGW5XE$$dN$T$$dAZU$$dCOO$$dOCLCF$$dOCLCQ
000753459 049__ $$aISEA
000753459 050_4 $$aQA267
000753459 08204 $$a004.01/51$$223
000753459 1001_ $$aGöbel, Susanne,$$eauthor.
000753459 24512 $$aA polynomial translation of mobile ambients into safe petri nets$$h[electronic resource] :$$bunderstanding a calculus of hierarchical protection domains /$$cSusanne Göbel.
000753459 264_1 $$aWiesbaden :$$bSpringer Vieweg,$$c[2016]
000753459 264_4 $$c©2016
000753459 300__ $$a1 online resource :$$bcolor illustrations.
000753459 336__ $$atext$$btxt$$2rdacontent
000753459 337__ $$acomputer$$bc$$2rdamedia
000753459 338__ $$aonline resource$$bcr$$2rdacarrier
000753459 4901_ $$aBestMasters
000753459 504__ $$aIncludes bibliographical references.
000753459 5050_ $$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.
000753459 506__ $$aAccess limited to authorized users.
000753459 520__ $$aThe 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.
000753459 588__ $$aOnline resource; title from PDF title page (viewed January 28, 2016).
000753459 650_0 $$aPetri nets.
000753459 650_0 $$aComputer science$$xMathematics.
000753459 77608 $$iPrint version:$$z9783658117641
000753459 830_0 $$aBestMasters.
000753459 852__ $$bebk
000753459 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-658-11765-8$$zOnline Access$$91397441.1
000753459 909CO $$ooai:library.usi.edu:753459$$pGLOBAL_SET
000753459 980__ $$aEBOOK
000753459 980__ $$aBIB
000753459 982__ $$aEbook
000753459 983__ $$aOnline
000753459 994__ $$a92$$bISE