This book contains a selection of research papers describing recent advancesin the theory of concurrent systems and their applications. The papers were all presented at the CONCUR '92 conference, which has emerged as the premiere conference on formal aspects of concurrency. The authors include such prominent researchers as R. Milner, A. Pnueli, N. Lynch, and V.R. Pratt. The results represent advances in the mathematical understanding of the behavior of concurrent systems: topics covered include process algebras, models of true concurrency, compositional verification techniques, temporal logic, verification case studies, models of probabilistic and real-time systems, models of systems with dynamic structure, and algorithms and decidability results for system analysis. A key feature of CONCUR is its breadth: in one volume it presents a snapshot of the state of the art in concurrency theory. Assuch, it is indispensible to researchers - and would-be researchers - in theformal analysis of concurrent systems.

This volume contains papers from the North American Process Algebra Workshop, held in Stony Brook, New York, 28 August 1992. This was the first in a proposed series of workshops, intended to increase awareness of process algebras in the United States and Canada, and to promote their use and development. The workshop was held simultaneously with CONCUR 92, the annual conference on concurrency theories. It provided an important forum for the discussion and exchange of ideas, and allowed recent developments in the application of algebraic techniques to concurrency theory to be presented. The resulting volume provides a good cross-section of current research work in Canada, USA and Europe. Among the specific topics covered are: real-time calculi and expansion theorems; modal logics in timed process algebra; process communication environment; a process calculus with incomparable priorities; exception handling in process algebra; bisimulations on observation structures; computing ready simulations efficiently; analysis of value-passing CCS agents with infinite sorts; an extension of the testing method for processes passing infinite values; constructive semantics; a causality-based semantics for CCS. NAPAW 92 provides an comprehensive overview of this important, up-and-coming area of computer science. It will provide essential reading for both postgraduate students and researchers in industry and academia.

Free radicals, which are key intermediates in many thermal, photochemical and radiation processes, are important for a proper understanding of fundamental natural processes and the successful development of organic syntheses. After about one decade volume II/18 serves as a supplement and extension to volume II/13 and covers rate constants and other kinetic data of free radical reactions in liquids. Furthermore II/18 contains new chapters on reactions of radicals in excited states and of carbenes, nitrenes and analogues. Selected species in aqueous solutions for which other compilations are available were deliberately omitted as before, and for the same reason electron transfer equilibria of organic radicals were not covered.

This book was written primarily for all those DTP users and programmers who want to keep up with the rapid development of electronic publishing, particular those who wish to develop new systems for the output of typefaces. In this volume, various formats are presented, their properties discussed and production requirements analyzed. Appendices provide readers additional information, largely on digital formats for typeface storage.

The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.

This book constitutes the refereed proceedings of the First International Conference on the Foundations of Software Science and Computation Structures, FoSSaCS'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, in Lisbon, Portugal, in March/April 1998. The 19 revised full papers presented in the book were carefully selected from a total of 44 submissions. Among the topics covered are formal specification, automata theory, term rewriting and rewriting systems, process algebras, formal language theory, type theory, event structures, and iteration theory.

This volume constitutes the proceedings of the 7th International Conference on Computer Aided Verification, CAV '95, held in Liège, Belgium in July 1995. The book contains the 31 refereed full research papers selected for presentation at CAV '95 as well as abstracts or full papers of the three invited presentations. Originally oriented towards finite-state concurrent systems, CAV now covers all styles of verification approaches and a variety of application areas. The papers included range from theoretical issues to concrete applications with a certain emphasis on verification tools and the algorithms and techniques needed for their implementations. Beyond finite-state systems, real-time systems and hybrid systems are an important part of the conference.

This volume constitutes the proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software (TACS 2001) held at Tohoku U- versity, Sendai, Japan in October 2001. The TACS symposium focuses on the theoretical foundations of progr- ming and their applications. As this volume shows, TACS is an international symposium, with participants from many di?erent institutions and countries. TACS 2001 was the fourth symposium in the TACS series, following TACS’91, TACS’94, and TACS’97, whose proceedings were published as Volumes 526, 789, and 1281, respectively, of Springer-Verlag’s Lecture Notes in Computer Science series. The TACS 2001 technical program consisted of invited talks and contributed talks. In conjunction with this program there was a special open lecture by Benjamin Pierce; this lecture was open to non-registrants. TACS 2001 bene?ted from the e?orts of many people; in particular, members of the Program Committee and the Organizing Committee. Our special thanks go to the Program Committee Co-chairs: Naoki Kobayashi (Tokyo Institute of Technology) Benjamin Pierce (University of Pennsylvania).

Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra.This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications.