How to interpret and establish consistency results for semantics of concurrent programming languages

Fundamenta Informaticae

Volumn 29, Issue 3, 1997, Pages 225-256

  Baier, Christel ^a   Majster Cederbaum, Mila ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PROGRAMMING THEORY;

COMPUTATIONAL SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031070680     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-29302     Document Type: Article

References (43)

1. S. Abramsky: A Domain Equation for Bisimulation, Information and Computation, Vol. 92, 1991.
2. S. Abramsky, A. Jung: Domain Theory, In S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, 1994.
3. C. Baier, M.E. Majster-Cederbaum: The Connection between an Event Structure Semantics and an Operational Semantics for TCSP, Acta Informatica 31, 1994.
4. C. Baier, M.E. Majster-Cederbaum: Denotational Semantics in the cpo and Metric Approach, Theoretical Computer Science, Vol. 135, 1994.
5. C. Baier, M.E. Majster-Cederbaum: Metric Semantics from Partial Order Semantics, to appear in Acta Informatica.
6. J.W. de Bakker, J.J.Ch. Meyer: Metric Semantics for Concurrency, Report CS-R8803, Centre for Mathematics and Computer Science, Amsterdam, 1988.
7. J.W. de Bakker, J.H.A. Warmerdam: Metric Pomset Semantics for a Concurrent Language with Recursion, Report CS-R9033, Centre for Mathematics and Computer Science, Amsterdam, July 1990.
8. J.W. de Bakker, J.I.Zucker: Processes and the Denotational Semantics of Concurrency, Information and Control, Vol.54, No. 1/2, 1982.
9. G. Boudol, I. Castellani: Concurrency and Atomicity, Theoretical Computer Science, Vol. 59, 1988.
10. G. Boudol, I. Castellani: Three Equivalent Semantics for CCS, Lecture Notes in Computer Science 469, Springer-Verlag, 1990.
11. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe: A Theory of Communicating Sequential Processes, Journal of the ACM, Vol. 31, No. 3, July 1984.
12. K. Bruce, J.C. Mitchell: PER Models of Subtyping, Recursive Types and Higher-order Polymorphism, Proc. 19th ACM Symp. on Principles of Programming Languages, pp 316-327, 1992.
13. E.M. Clarke, E.A. Emerson: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic, Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science 131, 1981.
14. P. Degano, R. De Nicola, U. Montanari: On the Consistency of "Truly Concurrent' Operational and Denotational Semantics, Proc. Symposium on Logic in Computer Science, Edinburgh, 1988.
15. H. Ehrig, F. Parisi-Presicce, P. Boehm, C. Rieckhoff, C. Dimitrovici, M. Große-Rohde: Combining Data Type Specifications using Projection Algebras, Theoretical Computer Science, Vol. 71, pp 347-380, 1990.
16. R. Engelking: General Topology, Sigma Series in Rure Mathematics, Vol. 6, Heldermann Verlag Berlin, 1989.
17. G. Gierz, H. Hofmann, K. Keimel, J. Lawson, M. Mislove, D. Scott: A Compendium of Continuous Lattices, Springer-Verlag, 1980.
18. U. Goltz, R. Loogen: Modelling Nondeterministic Concurrent Processes with Event Structures, Fundamenta Informaticae, Vol. 14, No.1, 1991.
19. U. Goltz, A. Mycroft: On the Relationship of CCS and Petri Nets, Proc. ICALP 84, Lecture Notes in Computer Science 172, Springer-Verlag, 1984.
20. M. Hennessy: Axiomatising Finite Delay Operators, Acta Informatica, Vol. 21, 1984.
21. M. Hennessy, R. Milner: On Observing Nondeterminism and Concurrency, in Automata, Languages and Programming, Lecture Notes in Computer Science 85, 1980.
22. C.A.R. Hoare: Communicating Sequential Processes, Prentice Hall, 1985.
23. C.A.R. Hoare, P.E. Lauer: Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica, Vol. 3, 1974.
24. E. Horita: A Fully Abstract Model for a Nonuniform Concurrent Language with Parametrization and Locality, in Proc. REX Workshop '92, Lecture Notes in Computer Science 666, Springer-Verlag 1993.
25. J.N. Kok, J.J.M.M. Rutten: Contractions in Comparing Concurrency Semantics, Report CS-R8755, Centre for Mathematics and Computer Science, November 1987.
26. L. Lamport: Specifying Concurrent Program Modules, ACM Transactions on Programming Languages and Systems, Vol. 5, No. 2, 1983.
27. K. Larsen: Ideal Specification Formalism = Expressivity + Compositionality + Decidability + Testability + ..., Proc. CONCUR'90, Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science 458, pp 33-56, 1990.
28. M. Majster-Cederbaum: General Properties of Semantics, Habilitation Thesis, Technische Universität München, 1983.
29. M. Majster-Cederbaum, C. Baier: Metric Completion versus Ideal Completion, to appear in Theoretical Computer Science, Vol. 170. (Extended abstract in Proc. STRICT 95, J. Desel (ed.), Springer-Verlag.)
30. M. Majster-Cederbaum, F. Zetzsche: The Comparison of a CPO-Based with a CMS-Based Semantics for CSP, Theoretical Computer Science, Vol. 124, 1994.
31. R. Milner: A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer-Verlag, 1980.
32. R. Milner: Communication and Concurrency, Prentice Hall, 1989.
33. M.W. Mislove, F.J. Oles: Full Abstraction and Unnested Recursion, in Proc. REX Workshop '92, Lecture Notes in Computer Science 666, Springer-Verlag, 1993.
34. R. de Nicola. M. Hennessy: Testing Equivalences for Processes, Theoretical Computer Science, Vol. 34, 1984.
35. E.R. Olderog: TCSP: Theory of Communicating Sequential Processes, Advances in Petri-Nets 1986, Lecture Notes in Computer Science 255, Springer-Verlag, 1987.
36. E.R. Olderog: Operational Petri-Net Semantics for CCSP, Advances in Petri-Nets 1987, Lecture Notes in Computer Science 266, Springer-Verlag, 1987.
37. G.D. Plotkin: An Operational Semantics for CSP, Formal Description of Programming Concepts II, D. Bjorner, North Holland, 1983.
38. A. Pnueli: The Temporal Logic of Programs, 18th Ann. Symp. on Foundations of Computer Science, Providence, 1977.
39. W. Reisig: Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness, Proc. ICALP 84, Lecture Notes in Computer Science 172, Springer-Verlag, 1984.
40. W. Reisig: Elements of a Temporal Logic Coping with Concurrency, SFB-Bericht 342/23, 92A, Techn. Universität München, 1992.
41. M. Spanier: Vergleich zweier Theorien nebenläufiger Prozesse, Ph.D.Thesis, Universität Mannheim, 1993.
42. G. Winskel: Synchronisation Trees, Theoretical Computer Science, Vol. 34, pp 33-82, 1984.
43. G. Winskel: An introduction to event structures, Lecture Notes in Computer Science 354, pp 364-397, Springer-Verlag, 1988.