J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
➤ Gửi thông báo lỗi ⚠️ Báo cáo tài liệu vi phạmNội dung chi tiết: J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
Preface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ulus of symbols combining according to certain defined laws. Completing the picture, a calculus is a system or method of calculation. Despite going back as far as the 13th Century, collectively, these definitions do a good job of accurately conveying the meaning of this Handbook's subject: process a J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) lgebra.A process algebra is a formal description technique for complex computer systems, especially those with communicating, concurrently executing cJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
omponents. A number of different process algebras have been developed - ACP [1], CCS [6|, and TCSP [2J being perhaps the best-known - but all share (hPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ones. CCS. for example, contains six operators in total, including ones for composing systems in parallel and others for choice and scoping.•Operational semantics. Process algebras are typically equipped with a Plotkin-Style [7] structural operational semantics (SOS) that describes the single-step J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) execution capabilities of systems. Using SOS, systems represented as terms in the algebra can be “compiled” into labeled transition systems.•BehavioraJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
l reasoning via equivalences and preorders. Process algebras also feature the use of behavioral relations as a means for relating different systems giPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ement".In a process-algebraic approach to system verification, one typically writes two specifications. One, call it Sys, captures the design of the actual system and the other, call it Spec, describes the system’s desired “high-level" behavior. One may then establish the correctness of Sys with res J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) pect to Spec by showing that Sys behaves the “same as" Spec (if using an equivalence) or by showing that it refines Spec (if using a preorder).EstabliJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
shing the correctness of Sys with respect to Spec can be done in a syntax-oriented manner or in a semantics-oriented manner. In the former case, an axPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) n the latter case, one can appeal directly to the definition of the behavioral relation, and to the operational semantics of the two expressions. to show that they are related. In certain cases, e.g., when Sys and Spec are “finite-state”, verification, be it syntax-based or semantics-based, can be c J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) arried out automatically.vviPrefaceThe advantages to an algebraic approach arc the following.•System designers need learn only one language for specifJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
ications and designs.•Related processes may be substituted for one another inside other processes. This makes process algebras particularly suitable fPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) r systems.•Processes may be minimized with respect to the equivalence relation before being analyzed; this sometimes leads to orders of magnitude improvement in the performance of verification routines.Process-algebraic system descriptions can also be verified using model checking [3J, a technique f J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) or ascertaining if a labeled transition system satisfies a correctness property given as a temporal-logic formula. Model checking has enjoyed considerJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
able success in application to hardware designs. Progress is now being seen in other application domains such as software and protocol verification.2.Preface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ification and behavior rather than language recognition and generation. Process algebra also embodies the principles of cellular automata [5] - cells receiving inputs from neighboring cells and then taking appropriate action - while adding a notion of programmability: nondeterminism, dynamic topolog J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ies, evolving cell behavior, etc.Process algebra lays the groundwork for a rigorous system-design ideology, providing support for specification, verifJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
ication, implementation, testing and other life-cycle-critical activities. Interest in process algebra, however, extends beyond the system-design arenPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) this HandbookThis Handbook documents the fate of process algebra from its modem inception in the late 197O’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 J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) what process algebra brings to the table as a formal system description and verification technique.The Handbook is divided into six parts, the first fJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
ive of which cover various theoretical and foundational aspects of process algebra. Part 6, the final part, is devoted to tools for applying process aPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) endently of each other. In total, there are 19 chapters spanning roughly 1300 pages. Collectively, the Handbook chapters give a comprehensive, albeit necessarily incomplete, view of the field.Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. In Chapter J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) 1, The Linear Time - Branching Time Spectrum L van Glabbeek givesPrefaceviia useful structure to, and an encyclopedic account of, the many behavioralJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
relations that have been proposed in the process-algebra literature. Chapter 2, Trace-Oriented Models of Concurrency by Broy and Olderog. provides anPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ironment. Aceto, Fokkink and Verhoef present a thorough account of Structural Operational Semantics in Chapter 3. Pan 1 concludes w ith Chapter 4, Modal Logics and Mu-Calculi: An Introduction by Bradfield and Stirling. Modal logics, which extend classical logic with operators for possibility and nec J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) essity, play an important role in filling out the semantic picture of process algebra.Part 2 is devoted to the sub-specialization of process algebra kJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
nown as finite-state processes. This class of processes holds a strong practical appeal as finite-state systems can be verified in an automatic, push-Preface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) tions by Bergstra, Fokkink and Ponse; and from an algorithmic one: Chapter 6. Equivalence and Preorder Checking for Finite-State Systems by Cleaveland and Sokolsky.Infinite-state processes, the subject of Part 3, capture process algebra at its most expressive. Chapter 7, the first of the three chapt J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) ers in this part, A Symbolic Approach to Value-Passing Processes by Ingolfsdottir and Lin, systematically examines the class of infinite-state processJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
es arising from the ability to transmit data from an arbitrary domain of values. Symbolic techniques are proposed as a method for analyzing such systePreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) lue-passing process that is capable of transmitting communication channels and even processes themselves from one process to another. Finally, Burkhart, Caucal, Moller and Steffen consider the equivalence-checking and model-checking problems for a large variety of infinite-state processes in Chapter J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) 9, Verification on Infinite Structures.The three chapters of Part 4 explore several extensions to process algebra that make it easier to model the kiJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
nds of systems that arise in practice. Chapter 10 focuses on real-time systems. Process Algebra with Timing: Real Time and Discrete Time by MiddelburgPreface1.IntroductionAccording to the Oxford English Dictionary (OED II CD-ROM), a process is a series of actions or events, and an algebra is a calcu J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) mpact on process algebra of replacing the standard notion of “nondeterministically choose the next transition to execute” with one in which probability or priority information play pivotal roles. Chapter 11, Probabilistic Extensions of Process Algebras by Jonsson, Larsen and Yi. targets the probabil J a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001) istic case, which is especially useful for modeling system failure, reliability, and performance. Chapter 12, Priority in Process Algebra by CleavelanJ a bergstra, a ponse, s a smolka handbook of process algebra elsevier science (2001)
d, Liittgen and Natarajan, considers the case of priority, and shows how a process algebra with priority can be used to model interrupts, prioritizedGọi ngay
Chat zalo
Facebook