Semantic barbs and biorthogonality

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

Volumn 4423 LNCS, Issue , 2007, Pages 302-316

  Rathke, Julian ^a   Sassone, Vladimiro ^a   Sobociński, Pawel ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BROADCASTING; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION SYSTEMS;

BROADCAST COMMUNICATION REGIMES; PROCESS CALCULI; SEMANTIC BARBS;

SEMANTIC WEB;

EID: 37149033155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_22     Document Type: Conference Paper

References (20)

1. M. Abadi. TT-closed relations and admissibility. Mathematical Structures in Computer Science, 10:313-320, 2000.
2. R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous pi-calculus. Theoretical Computer Science, 195(2):291-324, 1998.
3. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992.
4. L. Cardelli. Brane calculi: Interactions of biological membranes. In Computational Methods in Systems Biology CMSB '04, volume 3082 of LNCS, pages 257-280, 2005.
5. L. Cardelli and A. D. Gordon. Mobile ambients. In Foundations of Software Science and Computation Structures, FoSSaCS '98. Springer Verlag, 1998.
6. V. Danos and J.-L. Krivine. Disjunctive tautologies as synchronisation schemes. In Computer Science Logic CSL '00, volume 1862 of LNCS, pages 292-301, 2000.
7. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the joincalculus. In Proceedings of Symposium on Principles of Programming Languages, POPL'96, pages 372-385. ACM Press, 1996.
8. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-101, 1987.
9. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
10. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 151(2):437-486, 1995.
11. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In International Conference on Concurrency Theory Concur '00, volume 1877 of LNCS, pages 243-258. Springer, 2000.
12. P.-A. Melliès and J. Vouillon. Recursive polymorphic types and parametricity in an operational framework. In Logic in Computer Science LICS '05, pages 82-91. IEEE, 2005.
13. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
14. R. Milner and D. Sangiorgi. Barbed bisimulation. In 9th Colloquium on Automata, Languages and Programming, ICALP '92, volume 623 of LNCS, pages 685-695. Springer, 1992.
15. U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, XVI: 171-199, 1992.
16. A. M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000.
17. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981. Reprinted in Journal of Logic and Algebraic Programming 60-61 (2004) 17-139.
18. M. Reid. Undergraduate Algebraic Geometry, volume 12 of London Mathematical Society Student Texts. Cambridge University Press, 1988.
19. J. Vitek and G. Castagna. A calculus of secure mobile computations. In IEEE Workshop on Internet Programming Languages, 1998.
20. R. Wille. Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival, editor, Ordered Sets, pages 445-470. Reidel, Dordrecht-Boston, 1982.