Compositional constructor interpretation over coalgebraic models for the π - Calculus

Electronic Notes in Theoretical Computer Science

Volumn 33, Issue , 2000, Pages 13-41

  Baldamus, Michael ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DIFFERENTIATION (CALCULUS); FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; THEOREM PROVING; TOPOLOGY;

BISIMULATIONS; COALGEBRAIC MODELS; COMMUNICATION TOPOLOGY; GROUND MODELS;

BOOLEAN ALGEBRA;

EID: 18944373647     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80342-1     Document Type: Conference Paper

References (28)

1. Abramsky S. A Domain Equation for Bisimulation. Information and Computation. 92:1991;161-218
2. Aczel P. Non-well-founded Sets. 1988;Stanford University
3. Aczel P. Final Universes of Processes. Mathematical Foundations of Programming Semantics, LNCS. MFPS conference. 802:1994;1-28 Springer-Verlag
4. Baeten J.C.M., Weijland W.P. Process Algebra. 1990;Cambridge University Press
5. de Bakker J.W., Zucker J.I. Processes and the Denotational Semantics of Concurrency. Information and Control. 54:1982;70-120
6. Baldamus M. A Non-well-founded Sets Semantics for Observation Congruence over Full CCS. Technical Report 1994/31, computer science department, Berlin University of Technology. 1994
7. Baldamus M. Adding Enrichments to Refined Interleavings: A New Model for the π-Calculus. Technical Report MATH-AL-01-1999, Institute for Algebra, Dresden University of Technology. January 1999
8. Cattani L., Winskel G., Stark I. Presheaf Models for the π-Calculus. Category Theory in Computer Science. LNCS. CTCS conference. 1290:1997;106-126 Springer-Verlag
9. De Nicola R. Testing Equivalences and Fully Abstract Models for Communicating Processes. 1985;PhD Thesis CST-36-85, Department of Computer Science, The University of Edinburgh
10. Ferrari G.-L., Montanari U., Quaglia P. The Weak Late π-Calculus Semantics as Observation Equivalence. Concurrency Theory. LNCS. CONCUR conference. 962:1995;57-71 Springer-Verlag
11. Fiore M., Moggi E., Sangiorgi D. A Fully Abstract Model for the π-Calculus. Logic in Computer Science. LICS symposium. 1996;43-54 IEEE Computer Society Press
12. Forti M., Honsell F. A General Construction of Hyperuniverses. Theoretical Computer Science. 156:1996;203-215
13. Hennessy M. Algebraic Theory of Processes. 1988;The MIT Press
14. Hennessy M. A Fully Abstract Denotational Semantics for the π- Calculus. Technical Report 96:04, School of Cognitive and Computing Sciences, University of Sussex. 1996
15. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice Hall International
16. Honsell F., Lenisa M., Montanari U., Pistore M. Final Semantics for the π-Calculus. Programming Concepts and Methods. 1998;225-243 Chapman & Hall. PROCOMET conference
17. Ingólfsdóttir A. Semantic Models for Communicating Processes with Value-Passing. 1994;Report 8/94, School of Cognitive and Computing Sciences, University of Sussex
18. M. Lenisa. Themes in Final Semantics. PhD thesis, Universita di Pisa-Udine, 1998.
19. Milner R. Communication and Concurency. 1989;Prentice Hall International
20. Milner R. Functions as Processes. Mathematical Structures in Computer Science. 2:1992;119-141
21. Milner R., Parrow J., Walker D. Modal Logics for Mobile Processes. Concurrent/Theory. LNCS. Concur conference. 527:1991;45-60 Springer-Verlag
22. Milner R., Parrow J., Walker D. A Calculus of Mobile Processes, Parts I/II. Information and Computation 1992. Journal version of a technical report from. 100:1989;1-77
23. Milner R., Sangiorgi D. Barbed Bisimulation, Automata, Languages and Programming. LNCS. ICALP conference. 623:1992;685-695 Springer-Verlag
24. Quaglia P. The π-Calculus with Explicit Substitutions. 1996;PhD Thesis TD-09/96, University of Pisa-Genova-Udine
25. Rutten J. Processes as Terms: Non-well-founded Models for Bisimulation. Mathematical Structures in Computer Science. 2:1992;257-275
26. Rutten J., Turi D. Initial Algebra and Final Coalgebra Semantics for Concurrency. A Decade of Concurrency-Reflections and Perspectives. LNCS. REX school/symposium. 803:1994;530-583 Springer-Verlag
27. D. Sangiorgi. Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. PhD Thesis CST-99-93, Department of Computer Science, The University of Edinburgh, 1993.
28. Stark I. A Fully Abstract Domain Model for the π - Calculus. Logic in Computer Science. LICS symposium. 1996;36-42 IEEE Computer Society Press