Cantitate/Preț
Produs

Semantics of Probabilistic Processes: An Operational Approach

Autor Yuxin Deng
en Limba Engleză Hardback – 9 mar 2015
This book discusses the semantic foundations of concurrent systems with nondeterministic and probabilistic behaviour. Particular attention is given to clarifying the relationship between testing and simulation semantics and characterising bisimulations from metric, logical, and algorithmic perspectives. Besides presenting recent research outcomes in probabilistic concurrency theory, the book exemplifies the use of many mathematical techniques to solve problems in computer science, which is intended to be accessible to postgraduate students in Computer Science and Mathematics. It can also be used by researchers and practitioners either for advanced study or for technical reference.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 32409 lei  43-57 zile
  Springer Berlin, Heidelberg – 6 oct 2016 32409 lei  43-57 zile
Hardback (1) 33023 lei  43-57 zile
  Springer Berlin, Heidelberg – 9 mar 2015 33023 lei  43-57 zile

Preț: 33023 lei

Preț vechi: 41278 lei
-20% Nou

Puncte Express: 495

Preț estimativ în valută:
6320 6565$ 5250£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662451977
ISBN-10: 3662451972
Pagini: 249
Ilustrații: XIV, 249 p. 32 illus.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.54 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

1. Introduction.- 2. Mathematical Preliminaries.- 3. Probabilistic Bisimulation.- 4. Probabilistic Testing Semantics.- 5. Testing Finite Probabilistic Processes.- 6. Testing Finitary Probabilistic Processes.- 7. Weak probabilistic bisimulation.- Index.

Recenzii

“This is a good resource for understanding issuesrelated to the semantic foundations of concurrent systems. … Scholars andresearchers in computer science and mathematics will find this book useful. It consistsof very valuable technical information about the quantitative behavior ofconcurrent systems.” (Gulustan Dogan, Computing Reviews, October, 2015)

Notă biografică

Yuxin Deng got his BEng (1999) and MSc (2002) from Shanghai Jiao Tong University, China, and PhD (2005) from Ecole des Mines de Paris, France. He was a research associate at University of New South Wales, Australia (2005-2006). Since 2006 he has joined Shanghai Jiao Tong University and is now an associate professor in Department of Computer Science and Engineering. In 2011 he was a visiting research fellow at Carnegie Mellon University. During 2012-2013 he was a loaned expert at UNESCO Headquarters on secondment from the Ministry of Education of China. Dr. Deng’s research interests include concurrency theory, especially about process calculi, and formal semantics of programming languages, as well as formal verification of security protocols and distributed algorithms. His recent research focus is probabilistic concurrency theory for which he has contributed to the development of probabilistic testing semantics and (bi)simulation semantics. Dr. Deng has published 50 papers in international journals and conferences. He served as PC members for a number of conferences such as FORTE 2014, ICALP 2013, QEST 2013 etc. and as reviewers for many journals and conferences such as ACM Transactions on Computational Logic, Theoretical Computer Science, Information and Computation, Logical Methods in Computer Science, Formal Aspect of Computing, ICALP, LICS, CONCUR, FOSSACS, etc.

Textul de pe ultima copertă

This book discusses the semantic foundations of concurrent systems with nondeterministic and probabilistic behaviour. Particular attention is given to clarifying the relationship between testing and simulation semantics and characterising bisimulations from metric, logical, and algorithmic perspectives. Besides presenting recent research outcomes in probabilistic concurrency theory, the book exemplifies the use of many mathematical techniques to solve problems in computer science, which is intended to be accessible to postgraduate students in Computer Science and Mathematics. It can also be used by researchers and practitioners either for advanced study or for technical reference.

Caracteristici

The first book available on probabilistic testing semantics Offers in-depth examination of probabilistic bisimulation from logical, metric, and algorithmic perspectives Demonstrates the use of many mathematical techniques in solving problems in computer science Includes supplementary material: sn.pub/extras