This book constitutes the refereed proceedings of the Joint Workshop on Process Algebra and Performance Modeling and Probabilistic Methods in Verification, PAPM-PROBMIV 2001, held in Aachen, Germany in September 2001. The 12 revised full papers presented together with one invited paper were carefully reviewed and selected from 23 submissions. Among the topics addressed are model representation, model checking, probabilistic systems analysis, refinement, Markov chains, random variables, stochastic timed systems, Max-Plus algebra, process algebra, system modeling, and the Mobius modeling framework.

Abstract: "In this thesis, we develop a mathematical formalism for the specification and proof of correctness of probabilistic communicating processes. This formalism combines a notion of probabilistic correctness with the theory of concurrency provided by the language of Communicating Sequential Processes (CSP). We first present the semantics of a model in which processes are defined as probability measures on the space of infinite traces. The model contains definitions for prefixing, probabilistic choice, hiding, simple parallel composition, sequential composition, interleaving, relabelling and recursion. These operators are defined as functions (mostly transformations) of probability measures.

This book is the sixth in a series of volumes concentrating on formal techniques applicable to distributed systems and protocols. The initial focus on techniques standardized by ISO and CCITT (Estelle, LOTOS, and SDL), widened in previous volumes to, for example, CCS, CSP, ASN.1, Z, Actor, VDM and RAISE, is yet again expanded. A strong theoretical component is balanced by a practical one, with papers included from the industrial as well as the academic communities. Offering a comprehensive presentation of the state of the art in theory, application, tools and industrialization of formal techniques, the publication provides an excellent orientation for the newcomer . By bringing together both researchers and practitioners, it also opens the communication between these groups vital for a continued cross-fertilization of knowledge and ideas for the future.

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.