000			03417nam a22003975i 4500
001			86399
003			ES-MaUEC
005			20230207040557.0
007			cr nn 008mamaa
008			160122s2016 gw | s |||| 0|eng d
020			_a9783658117658
040			_aES-MaUEC
050		4	_aQA267 _b.G634 2016
082	0	4	_a005.1015113
100	1		_aGöbel, Susanne _0Local _9100090
245	1	2	_aA Polynomial Translation of Mobile Ambients into Safe Petri Nets : _bUnderstanding a Calculus of Hierarchical Protection Domains _cby Susanne Göbel
250			_a1st ed.
260			_aWiesbaden _bSpringer Fachmedien Wiesbaden Vieweg _c2016
300			_a1 recurso en línea (IX, 66 páginas) _b15 ilustraciones en color
336			_aTexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
490	0		_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	3		_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.
710	2		_aSpringerLink (Online service) _0Local _9106996
942			_2lcc _cLE
988			_aEBOOK, asignarmaterias , EBSPRINGER
650	0	7	_aEstructuras de datos (Informática) _0 _2embne _9151535
650	0	7	_aAlgoritmos _0 _2embne _9141162
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://link.springer.com/book/10.1007/978-3-658-11765-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
901			_ai9783658117658
907			_a.b12956776 _b10-10-17 _c21-11-16
998			_am _a_alco _a_vill _b - - _cm _dz _e- _feng _ggw _h2
945			_aQA267 .G634 2016 EB _g1 _ieBOOK _j0 _lmae _o- _pEUR0.00 _q- _r- _sb _t15 _u0 _v0 _w0 _x0 _y.i11598608 _z06-04-17
999			_c86399 _d86399 _x1