Advertisement

Comparison of Process Algebra Equivalences Using Formats

  • Vashti Galpin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1644)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Astesiano and G. Reggio. Observational structures and their logic. Theoretical Computer Science, 96, 249–283, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 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. 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
  4. 4.
    B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42, 232–268, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6(2), 165–200, 1994.zbMATHCrossRefGoogle Scholar
  6. 6.
    I. Castellani. Bisimulations for concurrency. Technical Report CST-51-88, PhD Thesis, Department of Computer Science, University of Edinburgh, 1988.Google Scholar
  7. 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
  8. 8.
    R. de Simone. Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science, 37, 245–267, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    G.L. Ferrari and U. Montanari Parameterized structured operational semantics. Fundamenta Informaticae, 34, 1–31, 1998.zbMATHMathSciNetGoogle Scholar
  10. 10.
    W. Fokkink and R. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126, 1–10, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 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
  12. 12.
    J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100, 202–260, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    J.F. Groote. Transition systems specifications with negative premises. Theoretical Computer Science, 118, 263–299, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31(8), 697–718, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    P. Krishnan. Architectural CCS. Formal Aspects of Computing, 162, 162–187, 1996.CrossRefGoogle Scholar
  16. 16.
    R. Milner. Communication and concurrency. Prentice Hall, 1989.Google Scholar
  17. 17.
    C. Verhoef. A general conservative extension theorem in process algebra. IFIP Transactions A, 56, 149–168, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Vashti Galpin
    • 1
  1. 1.Programme for Highly Dependable Systems, Department of Computer ScienceWitsSouth Africa

Personalised recommendations