Abstract
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.
This research was supported in part by a Patrick and Margaret Flanagan Scholarship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Astesiano and G. Reggio. Observational structures and their logic. Theoretical Computer Science, 96, 249–283, 1992.
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.
K.L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In LICS’ 98. IEEE Computer Society, 153–164, 1998.
B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42, 232–268, 1995.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6(2), 165–200, 1994.
I. Castellani. Bisimulations for concurrency. Technical Report CST-51-88, PhD Thesis, Department of Computer Science, University of Edinburgh, 1988.
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.
R. de Simone. Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science, 37, 245–267, 1985.
G.L. Ferrari and U. Montanari Parameterized structured operational semantics. Fundamenta Informaticae, 34, 1–31, 1998.
W. Fokkink and R. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126, 1–10, 1996.
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.
J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100, 202–260, 1992.
J.F. Groote. Transition systems specifications with negative premises. Theoretical Computer Science, 118, 263–299, 1993.
A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31(8), 697–718, 1994.
P. Krishnan. Architectural CCS. Formal Aspects of Computing, 162, 162–187, 1996.
R. Milner. Communication and concurrency. Prentice Hall, 1989.
C. Verhoef. A general conservative extension theorem in process algebra. IFIP Transactions A, 56, 149–168, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galpin, V. (1999). Comparison of Process Algebra Equivalences Using Formats. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_31
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive