Comparison of Process Algebra Equivalences Using Formats
This research defines a new format called extended tyft/tyxt format. This format is able to express process algebras with structured or non-atomic labels and their bisimulation-based semantic equivalences. A general notion of bisimulation is a congruence for this format, under reasonable technical conditions. The aim of this format is to allow the comparison of bisimulation-based semantic equivalences and to this end, this paper defines a number of extensions and gives results showing conditions required to achieve the extensions. This paper also discusses the process algebras that can be expressed in this format and presents a new semantic equivalence comparison result for multiprocessor bisimulation and pomset bisimulation.
Unable to display preview. Download preview PDF.
- 2.J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. In E. Best, (ed). CONCUR’ 93, LNCS 715. Springer-Verlag, 477–492, 1993.Google Scholar
- 3.K.L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In LICS’ 98. IEEE Computer Society, 153–164, 1998.Google Scholar
- 6.I. Castellani. Bisimulations for concurrency. Technical Report CST-51-88, PhD Thesis, Department of Computer Science, University of Edinburgh, 1988.Google Scholar
- 7.P. Darondeau and P. Degano. Causal trees. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, (eds). ICALP 88, LNCS 372. Springer-Verlag, 234–248, 1989.Google Scholar
- 11.V.C. Galpin. Equivalence semantics for concurrency: comparison and application. Technical Report ECS-LFCS-98-397, PhD Thesis, Department of Computer Science, University of Edinburgh, 1998.Google Scholar
- 16.R. Milner. Communication and concurrency. Prentice Hall, 1989.Google Scholar
- 17.C. Verhoef. A general conservative extension theorem in process algebra. IFIP Transactions A, 56, 149–168, 1994.Google Scholar