A brief history of process algebra

DOI10.1016/j.tcs.2004.07.036zbMath1080.68072OpenAlexW2101206446MaRDI QIDQ1781995

Jos C. M. Baeten

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a-brief-history-of-process-algebra(76252f00-0009-4f27-9e24-79af986cc846).html

zbMATH Keywords

Process algebraHistory

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Using process algebra to develop predator-prey models of within-host parasite dynamics ⋮ Сравнительный логический анализ субстанциальной и процессуальной онтологий ⋮ Reasoning About Resources in the Embedded Systems Language Hume ⋮ Logic of simultaneity ⋮ Concurrent algorithm for integrating three-dimensional B-spline functions into machines with shared memory such as GPU ⋮ From symbolic constraint automata to Promela ⋮ A process calculus for privacy-preserving protocols in location-based service systems ⋮ Coupled similarity: the first 32 years ⋮ Formal Enforcement of Security Policies on Parallel Systems with Risk Integration ⋮ Multiphysics modelling of immune processes using distributed parameter systems ⋮ Logical Inference by DNA Strand Algebra ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Independence Abstractions and Models of Concurrency ⋮ Quantum process algebra with priorities ⋮ From individuals to populations: a mean field semantics for process algebra ⋮ SAT-based verification for timed component connectors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hume box calculus: Robust system development through software transformation ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Causal Unfoldings ⋮ Planning-based knowing how: a unified approach ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ A symbolic investigation of superspreaders ⋮ 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 ⋮ Formal enforcement of security policies on concurrent systems ⋮ Declarative Programming with Algebra ⋮ Processes with local and global liveness requirements ⋮ Algebra and logic for resource-based systems modelling ⋮ On linear logic planning and concurrency ⋮ Concurrencies in reversible concurrent calculi ⋮ Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems ⋮ Intensional Couplings in Variable-Structure Models

Uses Software

• Uppaal
• CADP
• Concurrency Workbench

Cites Work

• The algorithmic analysis of hybrid systems
• Algèbre de processus et synchronisation
• Programming languages and their definition. Selected papers ed. by C. B. Jones
• Calculi for synchrony and asynchrony
• A complete inference system for a class of regular behaviours
• A timed model for communicating sequential processes
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• A calculus of communicating systems
• A calculus of mobile processes. II
• The algebra of timed processes, ATP: Theory and application
• Mobile ambients
• Application of a stochastic name-passing calculus to representation and simulation of molecular processes
• Hybrid process algebra
• Process algebra for hybrid systems
• Process algebra with timing
• Kronos: A verification tool for real-time systems
• Uppaal in a nutshell
• The origins of structural operational semantics
• A structural approach to operational semantics
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Calculi for interaction
• Real time process algebra
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Flowgraphs and Flow Algebras
• A Proof System for Communicating Sequential Processes
• Process Algebra
• Applications of Process Algebra
• Guarded commands, nondeterminacy and formal derivation of programs
• Verifying properties of parallel programs
• A Powerdomain Construction
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Branching time and abstraction in bisimulation semantics
• Processes and the denotational semantics of concurrency
• A Compositional Approach to Performance Modelling
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item