Atjaunināt sīkdatņu piekrišanu

Mobility in Process Calculi and Natural Computing 2011 ed. [Hardback]

,
  • Formāts: Hardback, 210 pages, height x width: 235x155 mm, weight: 506 g, XIV, 210 p., 1 Hardback
  • Sērija : Natural Computing Series
  • Izdošanas datums: 04-Nov-2011
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642248667
  • ISBN-13: 9783642248665
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 91,53 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 107,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Mobility in Process Calculi and Natural Computing 2011 ed.Palielināt
  • Formāts: Hardback, 210 pages, height x width: 235x155 mm, weight: 506 g, XIV, 210 p., 1 Hardback
  • Sērija : Natural Computing Series
  • Izdošanas datums: 04-Nov-2011
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642248667
  • ISBN-13: 9783642248665
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783642248665.html
Keywords:
The design of formal calculi in which fundamental concepts underlying interactive systems can be described and studied has been a central theme of theoretical computer science in recent decades, while membrane computing, a rule-based formalism inspired by biological cells, is a more recent field that belongs to the general area of natural computing. This is the first book to establish a link between these two research directions while treating mobility as the central topic. In the first chapter the authors offer a formal description of mobility in process calculi, noting the entities that move: links (p-calculus), ambients (ambient calculi) and branes (brane calculi). In the second chapter they study mobility in the framework of natural computing. The authors define several systems of mobile membranes in which the movement inside a spatial structure is provided by rules inspired by endocytosis and exocytosis. They study their computational power in comparison with the classical notion of Turing computability and their efficiency in algorithmically solving hard problems in polynomial time. The final chapter deals with encodings, establishing links between process calculi and membrane computing so that researchers can share techniques between these fields.The book is suitable for computer scientists working in concurrency and in biologically inspired formalisms, and also for mathematically inclined scientists interested in formalizing moving agents and biological phenomena. The text is supported with examples and exercises, so it can also be used for courses on these topics.

This volume refers to the formal description of mobility in computer science, using p-calculus, ambient calculus, bioambients, brane calculi, and systems of mobile membranes. Concepts are supported by examples and exercises, which makes it suitable for relevant courses.

Recenzijas

From the reviews:

The book is very well written and structured. It provides enough background so that it can be read not only by experts but also by advanced undergraduate and graduate students. syntax of each formalism is clearly introduced and their operational semantics are unambiguously defined. Throughout the book, examples with illustrative figures are used to introduce the key definitions and concepts. Exercises are also provided that can guide the reader to more advanced analysis. (Mario Jesśs Pérez-Jiménez, Mathematical Reviews, March, 2014)

1 Mobility in Process Calculi 1(40)
1.1 π-calculus
1(4)
1.1.1 Syntax
2(1)
1.1.2 Operational Semantics
3(2)
1.1.3 Extensions
5(1)
1.1.4 Computational Power
5(1)
1.2 Timed Distributed π-calculus
5(17)
1.2.1 Syntax
6(1)
1.2.2 Typing System
7(10)
1.2.3 Operational Semantics
17(2)
1.2.4 Soundness of tDπ
19(3)
1.3 Mobile Ambients
22(4)
1.3.1 Syntax
23(1)
1.3.2 Operational Semantics
23(1)
1.3.3 Computability and Decidability
24(2)
1.4 Mobile Ambients with Timers
26(10)
1.4.1 Syntax
27(1)
1.4.2 Operational Semantics
28(3)
1.4.3 Subject Reduction
31(5)
1.5 Brane Calculi
36(5)
1.5.1 Syntax
37(1)
1.5.2 Operational Semantics
37(2)
1.5.3 Computability and Decidability
39(2)
2 Mobility in Membrane Computing 41(90)
2.1 Mobility in Cell Biology
41(2)
2.2 Membrane Computing
43(1)
2.3 Mobile Membranes
44(12)
2.3.1 Simple Mobile Membranes
45(2)
2.3.2 Enhanced Mobile Membranes
47(5)
2.3.3 Mutual Mobile Membranes
52(1)
2.3.4 Mutual Mobile Membranes with Objects on Surface
53(3)
2.4 Computability Power of Mobile Membranes
56(30)
2.4.1 Preliminaries
56(2)
2.4.2 Simple Mobile Membranes
58(3)
2.4.3 Enhanced Mobile Membranes
61(13)
2.4.4 Mutual Mobile Membranes
74(7)
2.4.5 Mutual Mobile Membranes with Objects on Surface
81(5)
2.5 Complexity of Mutual Mobile Membranes
86(35)
2.5.1 SAT Problem
87(4)
2.5.2 2QBF Problem
91(7)
2.5.3 Bin Packing Problem
98(8)
2.5.4 Subset Sum Problem
106(4)
2.5.5 Knapsack Problem (0/1)
110(5)
2.5.6 2-Partition Problem
115(6)
2.6 Decidability Results
121(10)
2.6.1 Mobile Membranes with Replication
121(2)
2.6.2 From Mobile Membranes to Mobile Ambients
123(1)
2.6.3 From Mobile Ambients to Petri Nets
124(4)
2.6.4 Deciding Reachability
128(3)
3 Encodings 131(64)
3.1 Dr into tDπ
131(6)
3.1.1 Algebraic Languages
132(1)
3.1.2 Barbed Bisimulations
133(1)
3.1.3 Coding Function
134(1)
3.1.4 Expressiveness and Faithfulness
135(2)
3.2 Pure Mobile Ambients into 7r-calculus
137(14)
3.2.1 Main Idea
138(2)
3.2.2 Tree-Wire Processes
140(1)
3.2.3 Ambients and Actions
141(1)
3.2.4 Simulating the Operational Semantics of Pure Ambients
142(2)
3.2.5 The Intended Meaning of the Encoding Constructions
144(4)
3.2.6 Encoding of Pure Ambients into π-processes
148(1)
3.2.7 Operational Correspondence
149(1)
3.2.8 Further Extensions
150(1)
3.3 Safe Mobile Ambients into Mutual Mobile Membranes
151(25)
3.3.1 Main Idea
151(8)
3.3.2 Translation
159(1)
3.3.3 Properties Preserved Through Translation
160(7)
3.3.4 Operational Correspondence
167(9)
3.4 Branes into Mobile Membranes with Objects on Surface
176(5)
3.4.1 Translation
177(1)
3.4.2 Preservation of Properties Through Translation
177(4)
3.5 Mobile Membranes with Objects on Surface into Petri Nets
181(14)
3.5.1 Coloured Petri Nets
182(1)
3.5.2 Mobile Membranes as Coloured Petri Nets
183(3)
3.5.3 LDL Degradation Pathway in Mobile Membranes
186(2)
3.5.4 Simulating LDL Degradation by CPN Tools
188(4)
3.5.5 Preservation of Properties Through Translation
192(3)
Summary 195(2)
References 197(6)
List of Figures 203(2)
List of Tables 205(2)
Index 207
Dr. Bogdan Aman graduated in mathematics from the Alexandru Ioan Cuza University of Iai, Romania and he received his PhD under the supervision of Prof. Gabriel Ciobanu at the Romanian Academy (Iai), Institute of Computer Science. His main research fields are membrane computing, computational modelling for systems biology, and process algebra. Prof. Gabriel Ciobanu has wide-ranging interests in computing including distributed systems, the theory of programming and computational aspects in biology. He has edited around 10 volumes and wrote over 100 papers on these topics; and he has received public recognition for his research, including a Japan Society for the Promotion of Science fellowship in 1995, the Grigore Moisil Award of the Romanian Academy of Sciences in 2000, the Octav Mayer Award of the Romanian Academy (Iai) in 2004, and a Royal Society of London international project award in 2009. He is the Editor-in-Chief of the Scientific Annals of Computer Science, and a member of many journal editorial boards and international conference program committees.