A Polynomial Translation of Mobile Ambients into Safe Petri Nets (Record no. 56832)

000 -LEADER
fixed length control field 03640nam a22005535i 4500
001 - CONTROL NUMBER
control field 978-3-658-11765-8
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421112044.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 160122s2016 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783658117658
-- 978-3-658-11765-8
082 04 - CLASSIFICATION NUMBER
Call Number 005.1015113
100 1# - AUTHOR NAME
Author G�obel, Susanne.
245 12 - TITLE STATEMENT
Title A Polynomial Translation of Mobile Ambients into Safe Petri Nets
Sub Title Understanding a Calculus of Hierarchical Protection Domains /
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2016.
300 ## - PHYSICAL DESCRIPTION
Number of Pages IX, 66 p. 15 illus. in color.
490 1# - SERIES STATEMENT
Series statement BestMasters
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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 ## - SUMMARY, ETC.
Summary, etc The 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.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-658-11765-8
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Wiesbaden :
-- Springer Fachmedien Wiesbaden :
-- Imprint: Springer Vieweg,
-- 2016.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer organization.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithms.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer logic.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Systems Organization and Communication Networks.
912 ## -
-- ZDB-2-SCS

No items available.