Comparison of process algebra equivalences using formats

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 341-350

  Galpin, Vashti ^a  

^a UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SEMANTICS;

BISIMULATIONS; COMPARISON RESULT; NEW FORMATS; PROCESS ALGEBRAS; SEMANTIC EQUIVALENCES; TECHNICAL CONDITIONS; TYFT/TYXT FORMAT;

ALGEBRA;

EID: 22644451272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_31     Document Type: Conference Paper

References (17)

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