A format for semantic equivalence comparison

Theoretical Computer Science

Volumn 309, Issue 1-3, 2003, Pages 65-109

  Galpin, Vashti ^a  

^a UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

Comparison of semantic equivalences; Extended tyft tyxt format; Process algebra; Structural operational semantics; Structured operational semantics

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MULTIPROCESSING SYSTEMS; THEOREM PROVING;

BISIMULATION PROCESSES; PROCESS ALGEBRA;

SEMANTICS;

EID: 0344496962     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00129-4     Document Type: Article

References (42)

1. Aceto L. Deriving complete inference systems for a class of GSOS languages generating regular behaviours. Jonsson B., Parrow J. CONCUR '94. Lecture Notes in Computer Science. Vol. 836:1994;449-464 Springer, Berlin.
2. Aceto L. GSOS and finite labelled transition systems. Theoret. Comput. Sci. 131:1994;181-195.
3. Aceto L., Bloom B., Vaandrager F. Turning SOS rules into equations. Inform. Comput. 111:1994;1-52.
4. Aceto L., Fokkink W., Verhoef C. Conservative extension in structural operational semantics. Bull. European Assoc. Theoret. Comput. Sci. 69:1999;110-132.
5. Aceto L., Hennessy M. Towards action refinement in process algebras. Inform. Comput. 103:1993;204-269.
6. Aceto L., Hennessy M. Adding action refinement to a finite process algebra. Inform. Comput. 115:1994;179-247.
7. Aceto L., Ingólfsdóttir A. CPO models for compact GSOS languages. Inform. Comput. 129:1996;107-141.
8. Baeten J.C.M., Verhoef C. A congruence theorem for structured operational semantics with predicates. Best E. CONCUR '93. Lecture Notes in Computer Science. Vol. 715:1993;477-492 Springer, Berlin.
9. K.L. Bernstein, A congruence theorem for structured operational semantics of higher-order languages, in: LICS 98, IEEE Computer Society Press, New York, 1998, pp. 153-164.
10. Bloom B. Structured operational semantics for process algebras and equational axiom systems. Best E. CONCUR '93. Lecture Notes in Computer Science. Vol. 715:1993;539-540 Springer, Berlin.
11. Bloom B. Structural operational semantics for weak bisimulations. Theoret. Comput. Sci. 146:1995;25-68.
12. Bloom B., Istrail S., Meyer A.R. Bisimulation can't be traced. J. ACM. 42:1995;232-268.
13. Bol R., Groote J.F. The meaning of negative premises in transition system specifications. J. ACM. 43:1996;863-914.
14. Boudol G., Castellani I., Hennessy M., Kiehn A. A theory of processes with localities. Formal Aspects Comput. 6(2):1994;165-200.
15. I. Castellani, Bisimulations for concurrency, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1988, LFCS report ECS-LFCS-88-51.
16. D'Argenio P.D., Verhoef C. A general conservative extension theorem in process algebras with inequalities. Theoret. Comput. Sci. 177:1997;351-380.
17. Darondeau P., Degano P. Causal trees. Ausiello G., Dezani-Ciancaglini M., Ronchi Della Rocca S. ICALP 88. Lecture Notes in Computer Science. Vol. 372:1989;234-248 Springer, Berlin.
18. de Simone R. Higher-level synchronising devices in MEIJE-SCCS. Theoret. Comput. Sci. 37:1985;245-267.
19. Degano P., Priami C. Enhanced operational semantics. a tool for describing and analyzing concurrent systems ACM Comput. Surveys. 33:2001;135-176.
20. Ferrari G.L., Montanari U. Parameterized structured operational semantics. Fund. Informat. 34:1998;1-31.
21. Fokkink W., van Glabbeek R. Ntyft/ntyxt rules reduce to ntree rules. Inform. Comput. 126:1996;1-10.
22. Fokkink W., Verhoef C. A conservative look at operational semantics with variable binding. Inform. Comput. 146:1998;24-54.
23. V.C. Galpin, Equivalence semantics for concurrency: comparison and application, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1998, LFCS report ECS-LFCS-98-397, http://www.lfcs.informatics.ed.ac.uk/reports .
24. Galpin V.C. Comparison of process algebra equivalences using formats. Wiedermann J., van Emde Boas P., Nielsen M. ICALP '99. Lecture Notes in Computer Science. Vol. 1644:1999;341-350 Springer, Berlin.
25. Galpin V.C. Algebraic results for structured operational semantics. South African Comput. J. 26:2000;13-21.
26. n -bisimulations for CCS agents Tarlecki A. MFCS '91. Lecture Notes in Computer Science. Vol. 520:1991;170-180 Springer, Berlin.
27. Groote J.F. Transition systems specifications with negative premises. Theoret. Comput. Sci. 118:1993;263-299.
28. Groote J.F., Vaandrager F. Structured operational semantics and bisimulation as a congruence. Inform. Comput. 100:1992;202-260.
29. M. Hennessy, A proof system for weak ST-bisimulation over a finite process algebra, Technical Report 6/91, Computer Science, University of Sussex, 1991.
30. Howe D.J. Proving congruence of bisimulation in functional programming languages. Inform. Comput. 124:1996;103-112.
31. Kiehn A. Comparing locality and causality based equivalences. Acta Inform. 31(8):1994;697-718.
32. Krishnan P. Architectural CCS. Formal Aspects Comput. 162:1996;162-187.
33. Middelburg C.A. Variable binding operators in transition system specifications. J. Logic Algebraic Programming. 47(1):2001;15-45.
34. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood Cliffs, NJ.
35. R. Milner, Operational and algebraic semantics of concurrent processes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, MIT Press, Cambridge, MA, 1994, pp. 1201-1242.
36. Milner R., Parrow J., Walker D. A calculus of mobile processes I & II. Inform. Comput. 100:1992;1-77.
37. Mosses P.D. Foundations of modular SOS. Kutyl*owski M., Pacholski L., Wierzbicki T. MFCS '99. Lecture Notes in Computer Science. Vol. 1672:1999;70-80 Springer, Berlin.
38. G. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1988.
39. van Glabbeek R.J. Full abstraction in structural operational semantics. Nivat M., Rattray C., Rus T., Scollo G. AMAST '93, Workshops in Computing. 1993;77-84 Springer, Berlin.
40. van Glabbeek R.J. The meaning of negative premises in transition system specifications II. Meyer auf der Heide F., Monien B. ICALP 96. Lecture Notes in Computer Science. Vol. 1099:1996;502-513 Springer, Berlin.
41. Verhoef C. A general conservative extension theorem in process algebra. IFIP Trans. A. 56:1994;149-168.
42. Verhoef C. A congruence theorem of struc tured operational semantics with predicates and negative premises. Nordic J. Comput. 2:1995;274-302.