Timing issues are of growing importance for the conceptualization and design of computer-based systems. Timing may simply be essential for the correct behaviour of a system, e.g. of a controller. Even if timing is not essential for the correct behaviour of a system, there may be good reasons to introduce it in such a way that suitable timing becomes relevant for the correct behaviour of a complex system. This book is unique in presenting four algebraic theories about processes, each dealing with timing from a different point of view, in a coherent and systematic way. The timing of actions is either relative or absolute and the underlying time scale is either discrete or continuous.

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.

Collects the Latest Research Involving the Application of Process Algebra to ComputingExploring state-of-the-art applications, Process Algebra for Parallel and Distributed Processing shows how one formal method of reasoning-process algebra-has become a powerful tool for solving design and implementation challenges of concurrent systems. Parallel Pr

A large class of computing systems can be specified and verified by abstracting away from the temporal aspects of their behavior. In real-time systems,instead, time issues become essential. Their correctness depends not only on which functions they can perform, but also on the action execution time. Due to their importance and design challenges, real-time systems have attracted the attention of a considerable number of computer scientists and engineers from various research areas. This volume collects a set of papers accompanying the lectures of the fourth edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM). The school addressed the use of formal methods in computer science as a prominent approach to the r- orous design of computer, communication and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the field. SFM-04:RT was devoted to real-time systems. It covered formal models and languages for the specification,modeling,analysis,and verification of the seti- critical systems, the expressiveness of such models and languages, as well as supporting tools and related applications in different domains.

Models that include a notion of time are ubiquitous in disciplines such as the natural sciences, engineering, philosophy, and linguistics, but in computing the abstractions provided by the traditional models are problematic and the discipline has spawned many novel models. This book is a systematic thorough presentation of the results of several decades of research on developing, analyzing, and applying time models to computing and engineering. After an opening motivation introducing the topics, structure and goals, the authors introduce the notions of formalism and model in general terms along with some of their fundamental classification criteria. In doing so they present the fundamentals of propositional and predicate logic, and essential issues that arise when modeling time across all types of system. Part I is a summary of the models that are traditional in engineering and the natural sciences, including fundamental computer science: dynamical systems and control theory; hardware design; and software algorithmic and complexity analysis. Part II covers advanced and specialized formalisms dealing with time modeling in heterogeneous software-intensive systems: formalisms that share finite state machines as common “ancestors”; Petri nets in many variants; notations based on mathematical logic, such as temporal logic; process algebras; and “dual-language approaches” combining two notations with different characteristics to model and verify complex systems, e.g., model-checking frameworks. Finally, the book concludes with summarizing remarks and hints towards future developments and open challenges. The presentation uses a rigorous, yet not overly technical, style, appropriate for readers with heterogeneous backgrounds, and each chapter is supplemented with detailed bibliographic remarks and carefully chosen exercises of varying difficulty and scope. The book is aimed at graduate students and researchers in computer science, while researchers and practitioners in other scientific and engineering disciplines interested in time modeling with a computational flavor will also find the book of value, and the comparative and conceptual approach makes this a valuable introduction for non-experts. The authors assume a basic knowledge of calculus, probability theory, algorithms, and programming, while a more advanced knowledge of automata, formal languages, and mathematical logic is useful.

This collection of essays reflects the breadth of research in computer science. Following a biography of Robin Milner it contains sections on semantic foundations; programming logic; programming languages; concurrency; and mobility.

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.

The first book to provide a comprehensive overview of the subject rather than a collection of papers. The author is a recognized authority in the field as well as an outstanding teacher lauded for his ability to convey these concepts clearly to many different audiences. A handy reference for practitioners in the field.

This Festschrift is dedicated to Jan Willem Klop on the occasion of his 60th birthday. The volume comprises a total of 23 scientific papers by close friends and colleagues, written specifically for this book. The papers are different in nature: some report on new research, others have the character of a survey, and again others are mainly expository. Every contribution has been thoroughly refereed at least twice. In many cases the first round of referee reports led to significant revision of the original paper, which was again reviewed. The articles especially focus upon the lambda calculus, term rewriting and process algebra, the fields to which Jan Willem Klop has made fundamental contributions.

Real-time and embedded systems are essential to our lives, from controlling car engines and regulating traffic lights to monitoring plane takeoffs and landings to providing up-to-the-minute stock quotes. Bringing together researchers from both academia and industry, the Handbook of Real-Time and Embedded Systems provides comprehensive covera