A general conservative extension theorem in process algebras with inequalities
- 19 May 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 177 (2) , 351-380
- https://doi.org/10.1016/s0304-3975(96)00292-7
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The meaning of negative premises in transition system specificationsJournal of the ACM, 1996
- Discrete time process algebraFormal Aspects of Computing, 1996
- Bisimulation can't be tracedJournal of the ACM, 1995
- Turning SOS Rules into EquationsInformation and Computation, 1994
- Process Algebra with Iteration and NestingThe Computer Journal, 1994
- Non interleaving process algebraPublished by Springer Nature ,1993
- Real time process algebraFormal Aspects of Computing, 1991
- Concurrency and atomicityTheoretical Computer Science, 1988
- Observation equivalence as a testing equivalenceTheoretical Computer Science, 1987
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985