A Generic Process Algebra

DOI10.1016/J.ENTCS.2005.12.077MaRDI QIDQ5262952zbMATH OpenOpenAlexFDO

Authors Mario Bravetti, Jos C. M. Baeten

Publication date 10 July 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2005.12.077

zbMATH Keywords

CSPprocess algebraCCSACP

Mathematics Subject Classification ID

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

Recommendations

• Process Algebra
• An algebra of processes
• scientific article; zbMATH DE number 782044
• Communicating Sequential Processes. The First 25 Years
• Publication:4941495
• scientific article; zbMATH DE number 937812
• scientific article; zbMATH DE number 139606
• A process algebra for probabilistic and nondeterministic processes

Cites work

• scientific article; zbMATH DE number 3958712 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4056992 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• A complete inference system for a class of regular behaviours
• Algebra of communicating processes with abstraction
• CONCUR 2005 – Concurrency Theory
• Embedding untimed into timed process algebra: the case for explicit termination
• Notes on the methodology of CCS and CSP
• Process algebra for synchronous communication
• Process algebra with propositional signals
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.

Cited in

(6)

• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• A process calculus with finitary comprehended terms
• scientific article; zbMATH DE number 1484272 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
• Linking formal methods in software development. A reflection on the development of rCOS

This page was built for publication: A Generic Process Algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262952)