Algebra handbook process

Ponse, S. Smolka, electronic resource. The Resource Handbook of process algebra, edited by J. Smolka, electronic resource Resource Information. The item Handbook of process algebra, edited by J. Smolka, electronic resource represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries. This item is available to borrow from all library branches. Contributor Bergstra, J.

A Ponse, A. Summary 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 's to the present. It is intended to serve as a reference source for researchers. Language eng eng. Publication Amsterdam New York, Elsevier, Edition 1st ed. Extent 1 online resource p. Note Description based upon print version of record. The linear time - branching time spectrum I. The semantics of concrete, sequential processes; Chapter 2.

Trace-oriented models of concurrency; Chapter 3. Structural operational semantics; Chapter 4. Process algebra with recursive operations; Chapter 6. Equivalence and preorder checking for finite-state systems; Part 3: Infinite-State Processes Chapter 7.

A symbolic approach to value-passing processesChapter 8. Verification on infinite structures; Part 4: Extensions; Chapter Process algebra with timing: Real time and discrete time; Chapter Probabilistic extensions of process algebras; Chapter Partial-order process algebra and its relation to Petri nets ; Chapter A unified model for nets and process algebras; Chapter Process algebras with localities; Chapter Action refinement Part 6: Tools and ApplicationsChapter 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. Preface J. Bergstra, A. Ponse, S. Part 1: Basic Theory. The linear time - brancing time spectrum I R. Trace-oriented models of concurrency M. Broy, E. Structural operational semantics L. Aceto, W. Fokkink, C. Modal logics and mu-calculi: an introduction J. Bradfield, C. Part 2: Finite-State Processes.

Process algebra with recursive operations J. Bergstra, W. Fokkink, A. Equivalence and preorder checking for finite-state systems R. Cleaveland, O. Part 3: Infinite-State Processes. A symbolic approach to value-passing processes A. An introduction to the pi-calculus P. Verification on infinite structures O. Burkart, D. Caucal, F. Moller, B. Part 4: Extensions. Process algebra with timing: real time and discrete time J.