Communicating and Mobile Systems

The Pi Calculus

Author: Robin Milner

Publisher: Cambridge University Press

ISBN: 9780521658690

Category: Computers

Page: 161

View: 1748

First account of new theory of communication in computing which describes networks, as well as parts of computer systems.

The Pi-Calculus

A Theory of Mobile Processes

Author: Davide Sangiorgi,David Walker

Publisher: Cambridge University Press

ISBN: 9780521543279

Category: Computers

Page: 596

View: 7498

Graduate text on the p-calculus, a mathematical model of mobile computing systems.

The Space and Motion of Communicating Agents

Author: Robin Milner

Publisher: Cambridge University Press

ISBN: 0521490308

Category: Computers

Page: 191

View: 1324

Robin Milner presents a unified structural theory for modelling networks of agents that is destined to have far-reaching significance.

Programming Distributed Computing Systems

A Foundational Approach

Author: Carlos A. Varela,Gul Agha

Publisher: MIT Press

ISBN: 0262313367

Category: Computers

Page: 296

View: 1026

Starting from the premise that understanding the foundations of concurrent programming is key to developing distributed computing systems, this book first presents the fundamental theories of concurrent computing and then introduces the programming languages that help develop distributed computing systems at a high level of abstraction. The major theories of concurrent computation -- including the p-calculus, the actor model, the join calculus, and mobile ambients -- are explained with a focus on how they help design and reason about distributed and mobile computing systems. The book then presents programming languages that follow the theoretical models already described, including Pict, SALSA, and JoCaml. The parallel structure of the chapters in both part one (theory) and part two (practice) enable the reader not only to compare the different theories but also to see clearly how a programming language supports a theoretical model. The book is unique in bridging the gap between the theory and the practice of programming distributed computing systems. It can be used as a textbook for graduate and advanced undergraduate students in computer science or as a reference for researchers in the area of programming technology for distributed computing. By presenting theory first, the book allows readers to focus on the essential components of concurrency, distribution, and mobility without getting bogged down in syntactic details of specific programming languages. Once the theory is understood, the practical part of implementing a system in an actual programming language becomes much easier.

Process Algebra: Equational Theories of Communicating Processes

Author: J. C. M. Baeten,T. Basten,Twan Basten,M. A. Reniers

Publisher: Cambridge University Press

ISBN: 0521820499

Category: Computers

Page: 460

View: 7805

Presents a unified overview of the various process algebras currently in use and sets the standard for the field.

A Distributed Pi-Calculus

Author: Matthew Hennessy

Publisher: Cambridge University Press

ISBN: 1139464841

Category: Computers

Page: N.A

View: 6077

Distributed systems are fast becoming the norm in computer science. Formal mathematical models and theories of distributed behaviour are needed in order to understand them. This book proposes a distributed pi-calculus called Dpi, for describing the behaviour of mobile agents in a distributed world. It is based on an existing formal language, the pi-calculus, to which it adds a network layer and a primitive migration construct. A mathematical theory of the behaviour of these distributed systems is developed, in which the presence of types plays a major role. It is also shown how in principle this theory can be used to develop verification techniques for guaranteeing the behavior of distributed agents. The text is accessible to computer scientists with a minimal background in discrete mathematics. It contains an elementary account of the pi-calculus, and the associated theory of bisimulations. It also develops the type theory required by Dpi from first principles.

Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

Author: Howard Bowman,Rodolfo Gomez

Publisher: Springer Science & Business Media

ISBN: 1846283361

Category: Computers

Page: 422

View: 3268

Intheworldweliveinconcurrencyisthenorm.Forexample,thehumanbody isamassivelyconcurrentsystem,comprisingahugenumberofcells,allsim- taneously evolving and independently engaging in their individual biological processing.Inaddition,inthebiologicalworld,trulysequentialsystemsrarely arise. However, they are more common when manmade artefacts are cons- ered. In particular, computer systems are often developed from a sequential perspective. Why is this? The simple reason is that it is easier for us to think about sequential, rather than concurrent, systems. Thus, we use sequentiality as a device to simplify the design process. However, the need for increasingly powerful, ?exible and usable computer systems mitigates against simplifying sequentiality assumptions. A good - ample of this is the all-powerful position held by the Internet, which is highly concurrent at many di?erent levels of decomposition. Thus, the modern c- puter scientist (and indeed the modern scientist in general) is forced to think aboutconcurrentsystemsandthesubtleandintricatebehaviourthatemerges from the interaction of simultaneously evolving components. Over a period of 25 years, or so, the ?eld of concurrency theory has been involved in the development of a set of mathematical techniques that can help system developers to think about and build concurrent systems. These theories are the subject matter of this book.

Modeling and Analysis of Communicating Systems

Author: Jan Friso Groote,Mohammad Reza Mousavi

Publisher: MIT Press

ISBN: 0262027712

Category: Computers

Page: 392

View: 1098

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.

Stochastic Network Calculus

Author: Yuming Jiang,Yong Liu

Publisher: Springer Science & Business Media

ISBN: 9781848001275

Category: Computers

Page: 232

View: 9225

Network calculus is a theory dealing with queuing systems found in computer networks. Its focus is on performance guarantees. Central to the theory is the use of alternate algebras such as the min-plus algebra to transform complex network systems into analytically tractable systems. To simplify the ana- sis, another idea is to characterize tra?c and service processes using various bounds. Since its introduction in the early 1990s, network calculus has dev- oped along two tracks—deterministic and stochastic. This book is devoted to summarizing results for stochastic network calculus that can be employed in the design of computer networks to provide stochastic service guarantees. Overview and Goal Like conventional queuing theory, stochastic network calculus is based on properly de?ned tra?c models and service models. However, while in c- ventional queuing theory an arrival process is typically characterized by the inter-arrival times of customers and a service process by the service times of customers, the arrival process and the service process are modeled in n- work calculus respectively by some arrival curve that (maybe probabilis- cally) upper-bounds the cumulative arrival and by some service curve that (maybe probabilistically) lower-bounds the cumulative service. The idea of usingboundstocharacterizetra?candservicewasinitiallyintroducedfor- terministic network calculus. It has also been extended to stochastic network calculus by exploiting the stochastic nature of arrival and service processes.

Handbook of Process Algebra

Author: J.A. Bergstra,A. Ponse,S.A. Smolka

Publisher: Elsevier

ISBN: 9780080533674

Category: Computers

Page: 1356

View: 3518

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.

Satellite Communication Systems Design

Author: S. Tirró

Publisher: Springer Science & Business Media

ISBN: 1461530067

Category: Technology & Engineering

Page: 837

View: 6883

Writing a comprehensive book on satellite communications requires the com mand of many technical disciplines and the availability of up-to-date information on international recommendations, system architectures, and equipment stand ards. It is therefore necessary to involve many authors, each possessing a good level of knowledge in a particular discipline. The problem of using a coherent and unambiguous set of definitions and basic terms has been solved by including in the book all the background information needed for understanding satellite communication systems, without any major reference to other textbooks specializing in particular disciplines. The obvious consequence of this approach has been the large size of the book, with the advantages, however, of practically complete independence from other books, more systematic discussion of the subject matter, and better readability. After the required background information, emphasis has been placed on the discussion of techniques and system design criteria rather than on specific equipment implementation or description of particular systems. The book may be divided in five parts as follows: • The first five chapters provide most of the required background information. • Chapter 6 is an introductory outline of satellite communication systems. • Chapters 7 to 13 deal with the various aspects of technical system design. • Chapter 14 discusses system economics. • Chapter 15 provides a brief insight into some foreseeable future develop ments of satellite communications.

Principles of Spread-Spectrum Communication Systems

Author: Don Torrieri

Publisher: Springer

ISBN: 3319140965

Category: Technology & Engineering

Page: 641

View: 2657

This textbook provides a concise but lucid explanation of the fundamentals of spread-spectrum systems with an emphasis on theoretical principles. The choice of specific topics is tempered by the author’s judgment of their practical significance and interest to both researchers and system designers. Throughout the book, learning is facilitated by many new or streamlined derivations of the classical theory. Problems at the end of each chapter are intended to assist readers in consolidating their knowledge and to provide practice in analytical techniques. This third edition includes new coverage of topics such as CDMA networks, Acquisition and Synchronization in DS-CDMA Cellular Networks, Hopsets for FH-CDMA Ad Hoc Networks, and Implications of Information Theory, as well as updated and revised material on Central Limit Theorem, Power Spectral Density of FH/CPM Complex Envelopes, and Anticipative Adaptive-Array Algorithm for Frequency-Hopping Systems.

Essential Business Process Modeling

Author: Michael Havey

Publisher: "O'Reilly Media, Inc."

ISBN: 9780596555153

Category: Computers

Page: 354

View: 7649

Ten years ago, groupware bundled with email and calendar applications helped track the flow of work from person to person within an organization. Workflow in today's enterprise means more monitoring and orchestrating massive systems. A new technology called Business Process Management, or BPM, helps software architects and developers design, code, run, administer, and monitor complex network-based business processes BPM replaces those sketchy flowchart diagrams that business analysts draw on whiteboards with a precise model that uses standard graphical and XML representations, and an architecture that allows it converse with other services, systems, and users. Sound complicated? It is. But it's downright frustrating when you have to search the Web for every little piece of information vital to the process. Essential Business Process Modeling gathers all the concepts, design, architecture, and standard specifications of BPM into one concise book, and offers hands-on examples that illustrate BPM's approach to process notation, execution, administration and monitoring. Author Mike Havey demonstrates standard ways to code rigorous processes that are centerpieces of a service-oriented architecture (SOA), which defines how networks interact so that one can perform a service for the other. His book also shows how BPM complements enterprise application integration (EAI), a method for moving from older applications to new ones, and Enterprise Service BUS for integrating different web services, messaging, and XML technologies into a single network. BPM, he says, is to this collection of services what a conductor is to musicians in an orchestra: it coordinates their actions in the performance of a larger composition. Essential Business Process Modeling teaches you how to develop examples of process-oriented applications using free tools that can be run on an average PC or laptop. You'll also learn about BPM design patterns and best practices, as well as some underlying theory. The best way to monitor processes within an enterprise is with BPM, and the best way to navigate BPM is with this valuable book.

Type-logical Semantics

Author: Bob Carpenter

Publisher: MIT Press

ISBN: 9780262531498

Category: Language Arts & Disciplines

Page: 575

View: 6992

The book, which stepwise develops successively more powerful logical and grammatical systems, covers an unusually broad range of material.

Mobile Wireless Communications

Author: Mischa Schwartz

Publisher: Cambridge University Press

ISBN: 9780521843478

Category: Computers

Page: 457

View: 1472

A 2004 introduction to digital mobile wireless networks, illustrating theoretical underpinnings with real-world examples.

Petri Nets

An Introduction

Author: Wolfgang Reisig

Publisher: Springer Science & Business Media

ISBN: 3642699685

Category: Computers

Page: 164

View: 6845

Net theory is a theory of systems organization which had its origins, about 20 years ago, in the dissertation of C. A. Petri [1]. Since this seminal paper, nets have been applied in various areas, at the same time being modified and theoretically investigated. In recent time, computer scientists are taking a broader interest in net theory. The main concern of this book is the presentation of those parts of net theory which can serve as a basis for practical application. It introduces the basic net theoretical concepts and ways of thinking, motivates them by means of examples and derives relations between them. Some extended examples il lustrate the method of application of nets. A major emphasis is devoted to those aspect which distinguish nets from other system models. These are for instance, the role of concurrency, an awareness of the finiteness of resources, and the pos sibility of using the same representation technique of different levels of ab straction. On completing this book the reader should have achieved a system atic grounding in the subject allowing him access to the net literature [25]. These objectives determined the subjects treated here. The presentation of the material here is rather more axiomatic than in ductive. We start with the basic notions of 'condition' and 'event' and the con cept of the change of states by (concurrently) occurring events. By generali zation of these notions a part of the theory of nets is presented.