A Generic Process Algebra
From MaRDI portal
Publication:5262952
DOI10.1016/J.ENTCS.2005.12.077zbMATH Open1316.68084OpenAlexW2129870576MaRDI QIDQ5262952FDOQ5262952
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
Recommendations
Cites Work
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebra of communicating processes with abstraction
- Process algebra with propositional signals
- A complete inference system for a class of regular behaviours
- A complete axiomatisation for observational congruence of finite-state behaviours
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Embedding untimed into timed process algebra: the case for explicit termination
- Title not available (Why is that?)
- CONCUR 2005 – Concurrency Theory
- Title not available (Why is that?)
- Notes on the methodology of CCS and CSP
Cited In (6)
- A ground-complete axiomatisation of finite-state processes in a generic process algebra
- A process calculus with finitary comprehended terms
- CONCUR 2005 – Concurrency Theory
- Title not available (Why is that?)
- 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
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)