This book presents surveys on the theory and practice of modeling, specifying, and validating concurrent systems. It contains surveys of techniques used in tools developed for automatic validation of systems. Other papers present recent developments in concurrency theory, logics of programs, model-checking, automata, and formal languages theory. The volume contains the proceedings from the workshop, Partial Order Methods in Verification, which was held in Princeton, NJ, in July 1996. The workshop focused on both the practical and the theoretical aspects of using partial order models, including automata and formal languages, category theory, concurrency theory, logic, process algebra, program semantics, specification and verification, topology, and trace theory. The book also includes a lively e-mail debate that took place about the importance of the partial order dichotomy in modeling concurrency.

This book is a balanced presentation of the latest techniques, algorithms and applications in computer science and engineering. The papers, written by eminent researchers in their fields, provide a vehicle for new research and development. The proceedings have been selected for coverage in: . OCo Index to Scientific & Technical Proceedings (ISTP CDROM version / ISI Proceedings). Contents: Internet Applications; Computing in Biology; Human Computer Interface; Parallel Computing/Techniques; Computing Education; Learning Algorithms; Communication Systems/Networks; Information Technology/Linguistics; Computing Formalism/Algorithms; AI/Fuzzy Sets Application and Theory; Imaging Applications. Readership: Researchers in artificial intelligence, databases, fuzzy logic, neural networks, software engineering/programming, theoretical computer science, machine perception/computer vision, computer engineering, biomedical engineering, biocomputing, bioinformatics, biophysics and computational physics."

This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, Belgium, with Pierre Wolper as thesis advisor. The general pattern of this work, is to turn logical and semantic ideas into exploitable algorithms. Thus, it perfectly fits the modern trend, viewing verification as a computer-aided activity, and as algorithmic as possible, not as a paper and pencil one, dealing exclusively with semantic and logical issues. Patrice Godefroid uses state-space exploration as the key technique, which, as such or elaborated into model checking, is attracting growing attention for the verification of concurrent systems. For most realistic examples, the methods presented provide a significant reduction of memory and time requirements for protocol verification.

This book, A Mosaic of Computational Topics: from Classical to Novel, is a collection of papers published to honor Professor Jetty Kleijn on the occasion of her 65th birthday. The scope and reach of her research is truly broad. She has made significant and lasting contributions in several research areas, both through the solving of challenging problems and in her pioneering of new research directions. She has published influential papers contributing to the foundations of computer science, in particular, in the area of formal languages and automata theory; to concurrency theory, in particular, Petri nets; and to natural computing, in particular bio-inspired computing and the computational modeling of bio-processes. A significant part of Professor Kleijn’s research portfolio is interdisciplinary, including her work on the Petri net modeling of biological processes and the development of novel models of information processing in bio-systems such as reaction systems. She is also passionately engaged in promoting the involvement of women in computer science. Jetty and her work are well-recognized by the scientific community, a fact demonstrated by the enthusiastic response to the invitation to contribute to this book, and the 14 carefully refereed papers collected together here explore a number of research topics that are either directly or indirectly related to research directions pursued by Jetty Kleijn in the course of her career.

The SPIN workshop series brings together researchers and practitioners int- ested in explicit state model checking technology as it is applied to the veri?- tion of software systems. Since 1995, when the SPIN workshop series was instigated, SPIN workshops have been held on an annual basis at Montr ́ eal (1995), New Brunswick (1996), Enschede (1997), Paris (1998), Trento (1999), Toulouse (1999), Stanford (2000), andToronto(2001). Whilethe?rstSPINworkshopwasastand-aloneevent,later workshopshavebeenorganizedasmoreorlesscloselya?liatedeventswithlarger conferences, in particular with CAV (1996), TACAS (1997), FORTE/PSTV (1998), FLOC (1999), World Congress on Formal Methods (1999), FMOODS (2000), and ICSE (2001). This year, SPIN 2002 was held as a satellite event of ETAPS 2002, the European Joint Conferences on Theory and Practice of Software. The co-location of SPIN workshops with conferences has proven to be very successful and has helped to disseminate SPIN model checking technology to wider audiences. Since 1999, the proceedings of the SPIN workshops have appeared in Springer-Verlag’s “Lecture Notes in Computer Science” series. The history of successful SPIN workshops is evidence for the maturing of model checking technology, not only in the hardware domain, but increasingly also in the software area. While in earlier years algorithms and tool development 1 around the SPIN model checker were the focus of this workshop series, the scopehasrecentlywidenedtoincludemoregeneralapproachestosoftwaremodel checking. Current research in this area concentrates not so much on completely verifyingsystemmodels,butratheronanalyzingsourcecodeinordertodiscover software faults.

Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. The editors and authors of this handbook are among the world's leading researchers in this domain, and the 32 contributed chapters present a thorough view of the origin, theory, and application of model checking. In particular, the editors classify the advances in this domain and the chapters of the handbook in terms of two recurrent themes that have driven much of the research agenda: the algorithmic challenge, that is, designing model-checking algorithms that scale to real-life problems; and the modeling challenge, that is, extending the formalism beyond Kripke structures and temporal logic. The book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.

This book consitutes the refereed proceedings of the 10th International Conference on Computer Aided Verification, CAV'98, held in Vancouver, BC, Canada, in June/July 1998. The 33 revised full papers and 10 tool papers presented were carefully selected from a total of 117 submissions. Also included are 11 invited contributions. Among the topics covered are modeling and specification formalisms; verification techniques like state-space exploration, model checking, synthesis, and automated deduction; various verification techniques; applications and case studies, and verification in practice.

A comprehensive introduction to the foundations of model checking, a fully automated technique for finding flaws in hardware and software; with extensive examples and both practical and theoretical exercises. Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a given system satisfies a desired property such as deadlock freedom, invariants, and request-response properties. This automated technique for verification and debugging has developed into a mature and widely used approach with many applications. Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. The book begins with the basic principles for modeling concurrent and communicating systems, introduces different classes of properties (including safety and liveness), presents the notion of fairness, and provides automata-based algorithms for these properties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms for verifying these logics, discussing real-time systems as well as systems subject to random phenomena. Separate chapters treat such efficiency-improving techniques as abstraction and symbolic manipulation. The book includes an extensive set of examples (most of which run through several chapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludes with a summary, bibliographic notes, and an extensive list of exercises of both practical and theoretical nature.

Logic (both Classical and Non-Classical) is being increasingly related with other fields in almost every scientific discipline and human activity. In this volume we have emphasized its role in the following fields of science: Artificial Intelligence, Robotics, Informatics in general, Technology, and correlated themes. The papers are written by some of the most prominent scientists of today.

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.