A Generic Process Algebra
From MaRDI portal
Publication:5262952
DOI10.1016/J.ENTCS.2005.12.077zbMath1316.68084OpenAlexW2129870576MaRDI QIDQ5262952
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
Related Items (3)
A ground-complete axiomatisation of finite-state processes in a generic process algebra ⋮ Linking formal methods in software development. A reflection on the development of rCOS ⋮ Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete inference system for a class of regular behaviours
- Algebra of communicating processes with abstraction
- A complete axiomatisation for observational congruence of finite-state behaviours
- Notes on the methodology of CCS and CSP
- Process algebra with propositional signals
- Process algebra for synchronous communication
- Embedding untimed into timed process algebra: the case for explicit termination
- CONCUR 2005 – Concurrency Theory
This page was built for publication: A Generic Process Algebra