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.

This tutorial volume presents a coherent and well-balanced introduction to the validation of stochastic systems; it is based on a GI/Dagstuhl research seminar. Supervised by the seminar organizers and volume editors, established researchers in the area as well as graduate students put together a collection of articles competently covering all relevant issues in the area. The lectures are organized in topical sections on: modeling stochastic systems, model checking of stochastic systems, representing large state spaces, deductive verification of stochastic systems.

The11thInternationalConferenceonInformationandCommunicationsSecurity (ICICS 2009) was held in Beijing, China during December 14–17, 2009. The ICICS conferenceseriesis anestablished forum that bringstogether people from universities,researchinstitutes, industry and governmentinstitutions, who work in a range of ?elds within information and communications security. The ICICS conferencesgiveattendeestheopportunitytoexchangenewideasandinvestigate developments in the state of the art. In previous years, ICICS has taken place in the UK (2008), China (2007, 2005, 2003, 2001 and 1997), USA (2006), Spain (2004), Singapore (2002), and Australia (1999). On each occasion, as on this one, the proceedings have been published in the Springer LNCS series. In total, 162 manuscripts from 20 countries and districts were submitted to ICICS 2009, and a total of 37 (31 regular papers plus 6 short papers) from 13 countries and districts were accepted (an acceptance rate of 23%). The accepted papers cover a wide range of disciplines within information security and applied cryptography. Each submission to ICICS 2009 was anonymously reviewed by three or four reviewers. We are very grateful to members of the Program C- mittee, which was composed of 44 members from 14 countries; we would like to thank them, as well as all the external referees, for their time and their valuable contributions to the tough and time-consuming reviewing process.

This little book is conceived as a service to mathematicians attending the 1998 International Congress of Mathematicians in Berlin. It presents a comprehensive, condensed overview of mathematical activity in Berlin, from Leibniz almost to the present day (without, however, including biographies of living mathematicians). Since many towering figures in mathematical history worked in Berlin, most of the chapters of this book are concise biographies. These are held together by a few survey articles presenting the overall development of entire periods of scientific life at Berlin. Overlaps between various chapters and differences in style between the chap ters were inevitable, but sometimes this provided opportunities to show different aspects of a single historical event - for instance, the Kronecker-Weierstrass con troversy. The book aims at readability rather than scholarly completeness. There are no footnotes, only references to the individual bibliographies of each chapter. Still, we do hope that the texts brought together here, and written by the various authors for this volume, constitute a solid introduction to the history of Berlin mathematics.

This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001. four invited papers were carefully reviewed and selected from a total of 208 submissions. complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity.

This book constitutes the refereed proceedings of the 4th International Conference of Z and B users, ZB 2005, held in Guildford, UK in April 2005. The 25 revised full papers presented together with extended abstracts of 2 invited papers were carefully reviewed and selected for inclusion in the book. The papers document the recent advances for the Z formal specification notation and for the B method, ranging from foundational, theoretical, and methodological issues to advanced applications, tools, and case studies.