On “Axiomatising Finite Concurrent Processes”
- 1 August 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (4) , 852-863
- https://doi.org/10.1137/s0097539793243600
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A new strategy for proving ω-completeness applied to process algebraPublished by Springer Nature ,2005
- Modular specification of process algebrasTheoretical Computer Science, 1993
- Towards Action-Refinement in Process AlgebrasInformation and Computation, 1993
- Process AlgebraPublished by Cambridge University Press (CUP) ,1990
- Distributed bisimulationsJournal of the ACM, 1989
- Axiomatising Finite Concurrent ProcessesSIAM Journal on Computing, 1988
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Process algebra for synchronous communicationInformation and Control, 1984