The research contained in this book represents work on the specification and verification of real-time systems using CSP.

Our understanding of real-time systems is rapidly approaching a level of maturity which calls for a consolidation of our present knowledge and experience. Particularly effective in influencing our understanding has been the conjoining of universal algebra with the theory and practice of real-time system development. This interplay between algebraic methodology and software technology (AMAST) for real-time systems is the theme for this text.Each chapter, derived from papers presented at the all-invitation 1st AMAST International Workshop on Real-Time Systems (Iowa, 1993), is written by leaders in their field. The chapters form an intriguing mix of modeling, specification, verification, and implementation of “real” real-time systems. They cover untimed and timed systems, sequential, concurrent and embedded real-time processes, integrated models using state machines, temporal logic and algebraic data models, real-time CSP, verification tools, system design using temporal logic, symbolic checking of discrete time models, iterative symbolic approximation in timing verification and verification of audio protocols, timed full LOTOS and timed LOTOS extensions, LOTOS specification of telephone services and flight warning computers, and performance analysis.

Real-time systems need to react to certain input stimuli within given time bounds. For example, an airbag in a car has to unfold within 300 milliseconds in a crash. There are many embedded safety-critical applications and each requires real-time specification techniques. This text introduces three of these techniques, based on logic and automata: duration calculus, timed automata, and PLC-automata. The techniques are brought together to form a seamless design flow, from real-time requirements specified in the duration calculus; via designs specified by PLC-automata; and into source code for hardware platforms of embedded systems. The syntax, semantics, and proof methods of the specification techniques are introduced; their most important properties are established; and real-life examples illustrate their use. Detailed case studies and exercises conclude each chapter. Ideal for students of real-time systems or embedded systems, this text will also be of great interest to researchers and professionals in transportation and automation.

This book constitutes the refereed proceedings of the International Workshop on Hybrid and Real-Time Systems, HART'97, held in Grenoble, France, in March 1997. The volume presents 18 revised full papers and 9 short presentations carefully selected during a highly competitive evaluation process; also included are full versions or abstracts of 7 invited papers or tutorials. Hybrid Systems consist of digital devices interacting with analog environments; thus the emerging area lies at the crossroads of computer science and control theory. This book focusses on mathematically sound methods for the rigorous and systematic design and analysis of hybrid systems and real-time systems.

The 47 papers in this volume provide a useful reference tool for the state-of-the-art research in real-time programming.

Formal Techniques in Real-Time and Fault-Tolerant Systems focuses on the state of the art in formal specification, development and verification of fault-tolerant computing systems. The term `fault-tolerance' refers to a system having properties which enable it to deliver its specified function despite (certain) faults of its subsystem. Fault-tolerance is achieved by adding extra hardware and/or software which corrects the effects of faults. In this sense, a system can be called fault-tolerant if it can be proved that the resulting (extended) system under some model of reliability meets the reliability requirements. The main theme of Formal Techniques in Real-Time and Fault-Tolerant Systems can be formulated as follows: how do the specification, development and verification of conventional and fault-tolerant systems differ? How do the notations, methodology and tools used in design and development of fault-tolerant and conventional systems differ? Formal Techniques in Real-Time and Fault-Tolerant Systems is divided into two parts. The chapters in Part One set the stage for what follows by defining the basic notions and practices of the field of design and specification of fault-tolerant systems. The chapters in Part Two represent the `how-to' section, containing examples of the use of formal methods in specification and development of fault-tolerant systems. The book serves as an excellent reference for researchers in both academia and industry, and may be used as a text for advanced courses on the subject.

The CSP approach has been widely used in the specification, analysis and verification of concurrent and real-time systems, and for understanding the particular issues that can arise when concurrency is present. It provides a language which enables specifications and designs to be clearly expressed and understood, together with a supporting theory which allows them to be analyzed and shown to be correct. This book supports advanced level courses on concurrency covering timed and untimed CSP. The first half introduces the language of CSP, the primary semantic models (traces, failures, divergences and infinite traces), and their use in the modelling, analysis and verification of concurrent systems. The second half of the book introduces time into the language, brings in the timed semantic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together. Accompanying website: http://www.cs.rhbnc.ac.uk/books/concurrency Containing the following: -Exercises and solutions -Instructors resources - Example CSP programs to run on FDR and ProBe -Links to useful sites Partial Contents: Part I: The Language of CSP; Sequential Processes; Concurrency; Abstraction and Control Flow; Part II: Analyzing Processes; Traces; Specification and Verification with Traces; Stable Failures; Specification and Verification with Failures; Failures, Divergences, and Infinite Traces; Part III: Introducing Time; The Timed Language; Timed transition systems; Part IV: Timed Analysis; Semantics of Timed CSP; Timed Specification and Verification; Timewise Refinement; Appendix A: Event-based Time; A.1 Standard CSP and $tock$; A.2 Translating from Timed CSP; A.3 Notes; Appendix B: Model-checking with FDR; B.1 Interacting with FDR; B.2 How FDR Checks Refinement; B.3 Machine readable CSP; Index of Processes.