Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)
Open Access
- 31 December 1999
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 27, 107-126
- https://doi.org/10.1016/s1571-0661(05)80298-1
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)Electronic Notes in Theoretical Computer Science, 1999
- Towards performance evaluation with general distributions in process algebrasPublished by Springer Nature ,1998
- OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIESInternational Journal of Foundations of Computer Science, 1995
- A Causal Operational Semantics of Action RefinementInformation and Computation, 1995
- Adding Action Refinement to a Finite Process AlgebraInformation and Computation, 1994
- On “Axiomatising Finite Concurrent Processes”SIAM Journal on Computing, 1994
- A static view of localitiesFormal Aspects of Computing, 1994
- A theory of processes with localitiesFormal Aspects of Computing, 1994
- Equivalence notions for concurrent systems and refinement of actionsPublished by Springer Nature ,1989
- Causal treesPublished by Springer Nature ,1989