This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas's graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.

Rigorous theory and real-world applications for modeling and analysis of the behavior of complex communicating computer systems. Complex communicating computer systems—computers connected by data networks and in constant communication with their environments—do not always behave as expected. This book introduces behavioral modeling, a rigorous approach to behavioral specification and verification of concurrent and distributed systems. It is among the very few techniques capable of modeling systems interaction at a level of abstraction sufficient for the interaction to be understood and analyzed. Offering both a mathematically grounded theory and real-world applications, the book is suitable for classroom use and as a reference for system architects. The book covers the foundation of behavioral modeling using process algebra, transition systems, abstract data types, and modal logics. Exercises and examples augment the theoretical discussion. The book introduces a modeling language, mCRL2, that enables concise descriptions of even the most intricate distributed algorithms and protocols. Using behavioral axioms and such proof methods as confluence, cones, and foci, readers will learn how to prove such algorithms equal to their specifications. Specifications in mCRL2 can be simulated, visualized, or verified against their requirements. An extensive mCRL2 toolset for mechanically verifying the requirements is freely available online; this toolset has been successfully used to design and analyze industrial software that ranges from healthcare applications to particle accelerators at CERN. Appendixes offer material on equations and notation as well as exercise solutions.

"The professional schools will resume their professional responsibilities just to the degree that they can discover a science of design, a body of intellectually tough, partly formalizable, partly empirical teachable doctrine about the design process. " [H.A. Simon, 1968} Design is aimed at the transformation or translation of a specification or high level description into a description in terms of some real-world primitives. As such it involves the removal of the uncertainty about the way in which a required system can be realized. To optimally support the design of systems, we must look at the design process as a whole and at the strong relationship that exists between a designer, the applied design method, the required design tools and the ways in which designs can be expressed. This book focuses on that relationship. The application field we are concerned with is the design of systems in which the communication between system elements is a major design feature. Examples of such communicating systems are: communication protocols, telephone exchange control systems, process control systems, highly modular systems, embedded software, interactive systems, and VLSI systems. In summary, we are concerned with systems in which concurrency plays a major role (concurrency defines the mutual relationship between the activities in the different parts of a system or within a collection of systems).

SDL 92 is the recognized international standard language for designing and specifying telecommunications systems, and is increasingly also used for RAD, real-time, interactive applications. This is the first complete introduction and reference to SDL for both novices and experienced system engineers. The book begins with an overview of basic SDL concepts, structure and syntax. It introduces SDL abstract data types, the SDL interpretation model, and shows how to specify protocols with SDL. All professional systems engineers, programmers and students of system development working in telecommunications, real-time, interactive and distributed systems.

This book gives a practical approach to modeling and analyzing communication protocols using UML 2. Network protocols are always presented with a point of view focusing on partial mechanisms and starting models. This book aims at giving the basis needed for anybody to model and validate their own protocols. It follows a practical approach and gives many examples for the description and analysis of well known basic network mechanisms for protocols. The book firstly shows how to describe and validate the main protocol issues (such as synchronization problems, client-server interactions, layer organization and behavior, etc.) in an easy and understandable way. To do so, the book considers and presents the main traditional network examples (e.g. unidirectional flows, full-duplex com-munication, error recovering, alternating bit). Finally, it presents the outputs resulting from a few simulations of these UML models. Other books usually only focus either on teaching UML or on analyzing network protocols, however this book will allow readers to model network protocols using a new perspective and integrating these two views, so facilitating their comprehension and development. Any university student studying in the field of computing science, or those working in telecommunications, embedded systems or networking will find this book a very useful addition.

"Models of Computation for Heterogeneous Embedded Systems" presents a model of computation for heterogeneous embedded systems called DFCharts. It targets heterogeneous systems by combining finite state machines (FSM) with synchronous dataflow graphs (SDFG). FSMs are connected in the same way as in Argos (a Statecharts variant with purely synchronous semantics) using three operators: synchronous parallel, refinement and hiding. The fourth operator, called asynchronous parallel, is introduced in DFCharts to connect FSMs with SDFGs. In the formal semantics of DFCharts, the operation of an SDFG is represented as an FSM. Using this representation, SDFGs are merged with FSMs so that the behaviour of a complete DFCharts specification can be expressed as a single, flat FSM. This allows system properties to be verified globally. The practical application of DFCharts has been demonstrated by linking it to widely used system-level languages Java, Esterel and SystemC.

This book constitutes the refereed proceedings of the 20th IFIP TC 6/WG 6.1 International Conference on Testing Communicating Systems, TestCom 2008, and the 8th International Workshop on Formal Approaches to Testing of Software, FATES 2008, jointly held in Tokyo, Japan, in June 2008. The 18 revised full papers presented together with 2 invited talks were carefully reviewed and selected from initially 58 submissions to both events. The papers cover new approaches, concepts, theories, methodologies, tools, and experiences in the field of testing of communicating systems and general software. They are organized in topical sections on general software testing, testing continuous and real-time systems, network testing, test generation, concurrent system testing, and applications of testing.

First Published in 1994. Routledge is an imprint of Taylor & Francis, an informa company.

This volume contains the proceedings of the 18th IFIP International Conference on Testing Communicating Systems (TestCom 2006).

"This book has collected the latest research within the field of real-time systems engineering, and will serve as a vital reference compendium for practitioners and academics"--Provided by publisher.