Introduction to process algebra
This book is a compact introduction into process algebra theory featuring in particular the dutch variant of process algebras, ACP. The text developed from an undergraduate course on the topic, and the author advertises additional material to support such a lecture via his homepage. As a result, every topic is presented very carefully with convincing examples and the book contains, many exercises as well as solutions. Although starting from a beginners level, there is no lack of formality: All results are presented as precise theorems and are equipped with full proofs. The book is very readable and helpful for those interested in one approach to process algebra. However, it lacks any comparison to the better known languages CCS and CSP. The structure of the book is as follows: After a very short introduction, Chapter 2 presents a basic process algebra with operators for alternative and for sequential composition. The structural operational semantics, bisimulation equivalence and an axiomatization is introduced. The concept is extended to communicating processes in Chapter 3. By introducing a parallel operator, merge operators, deadlock and encapsulation operators, all elements of the language ACP are captured. For coping with infinite behavior, Chapter 4 adds the (guarded) recursion operator to ACP. Chapter 5 is devoted to abstraction operators and internal actions (silent steps). As nontrivial examples, the concepts are applied in Chapter 6 to the verification of protocols. This chapter also provides a list of tools that are based on different process algebra approaches. Chapter 7 gives extensions to the approach such as the renaming operator, the state operator and priorities. About the last third of the book is filled with appendices on equational logic, on structural operational semantics (including modal logic) and on solutions to selected exercises.
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Global renaming operators in concrete process algebra
- ACP '95, international workshop on Algebra of communicating processes. Eindhoven, Netherlands, May 17--18, 1995
- Analysis of a distributed system for lifting trucks.
- The cones and foci proof technique for timed transition systems
- Process algebra and conditional composition
- Equivalence of recursive specifications in process algebra
- Special issue: Process algebra
- Automated verification of automata communicating via FIFO and bag buffers
- Modeling and verification of reconfigurable printing system based on process algebra
- A brief history of process algebra
- On the usability of process algebra: An architectural view
- Axiomatizing GSOS with termination
- Branching time and orthogonal bisimulation equivalence
- Process algebra with strategic interleaving
- An axiomatization for quantum processes to unifying quantum and classical computing
- Probabilistic process algebra to unifying quantum and classical computing in closed systems
- Entanglement in quantum process algebra
- Formal verification for KMB09 protocol
- Ensuring liveness properties of distributed systems: open problems
- Matching logic explained
- A structural approach to graph transformation based on symmetric Petri nets
- Modelling of DNA mismatch repair with a reversible process calculus
- A formal framework for distributed cyber-physical systems
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations
- Formal enforcement of security policies on concurrent systems
- Correctness checking of a quantum protocol for reliable communications via feedback
- Bisimilar and logically equivalent programs in PDL with parallel operator
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
- A theory of stochastic systems. II: Process algebra
- Reactive bisimulation semantics for a process algebra with timeouts
- Process algebra with recursive operations
- Bisimilar and logically equivalent programs in PDL
- Towards modelling of local reversibility
- Defining actions in concurrent declarative programming
- Independence abstractions and models of concurrency
- Modeling for Verification
- Process algebra and model checking
- A propositional dynamic logic for concurrent programs based on the -calculus
- scientific article; zbMATH DE number 7449995 (Why is no real title available?)
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Algebra unifies operational calculi
- scientific article; zbMATH DE number 4037177 (Why is no real title available?)
- Processes with infinite liveness requirements
- A process calculus with finitary comprehended terms
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- Process Algebra
- Applications of Process Algebra
- SAT-based verification for timed component connectors
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- scientific article; zbMATH DE number 858832 (Why is no real title available?)
- External behaviour of systems of state machines with variables
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- Interleaving strategies
- A Generic Process Algebra
- Dynamic consistency in process algebra: from paradigm to ACP
- Derivation tree analysis for accelerated fixed-point computation
- Communicating Sequential Processes. The First 25 Years
- Focus points and convergent process operators
- A formalization of anonymity and onion routing
- Inheritance of behavior
- Linearization in parallel pCRL
- Non-regular iterators in process algebra
- Modelling mutual exclusion in a process algebra with time-outs
- A full process algebraic representation of ant colony optimization
- Runtime composition of systems of interacting cyber-physical components
- Branching bisimilarity for processes with time-outs
- Process algebras as support for sustainable systems of services
- Execution architectures for program algebra
- Revisiting sequential composition in process calculi
- Towards a process calculus for REST: current state of the art
- Program algebra with a jump-shift instruction
- Automatic verification of distributed systems: the process algebra approach.
This page was built for publication: Introduction to process algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941495)
