Abstract
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory of barbs and demonstrate its robustness by showing that it gives rise to the correct observables in specific process calculi which model synchronous, asynchronous and broadcast communication regimes.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abadi, M.: \(\scriptstyle\top\top\)-closed relations and admissibility. Mathematical Structures in Computer Science 10, 313–320 (2000)
Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. Theoretical Computer Science 195(2), 291–324 (1998)
Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96, 217–248 (1992)
Cardelli, L.: Brane calculi: Interactions of biological membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–280. Springer, Heidelberg (2005)
Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, Springer, Heidelberg (1998)
Danos, V., Krivine, J.-L.: Disjunctive tautologies as synchronisation schemes. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 292–301. Springer, Heidelberg (2000)
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Proceedings of Symposium on Principles of Programming Languages, POPL’96, pp. 372–385. ACM Press, New York (1996)
Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1–101 (1987)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 151(2), 437–486 (1995)
Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)
Melliès, P.-A., Vouillon, J.: Recursive polymorphic types and parametricity in an operational framework. In: Logic in Computer Science LICS ’05, pp. 82–91. IEEE Computer Society Press, Los Alamitos (2005)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae XVI, 171–199 (1992)
Pitts, A.M.: Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10, 321–359 (2000)
Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University (1981), Reprinted in Journal of Logic and Algebraic Programming 60-61, 17–139 (2004)
Reid, M.: Undergraduate Algebraic Geometry. London Mathematical Society Student Texts, vol. 12. Cambridge University Press, Cambridge (1988)
Vitek, J., Castagna, G.: A calculus of secure mobile computations. In: IEEE Workshop on Internet Programming Languages, IEEE Computer Society Press, Los Alamitos (1998)
Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Rathke, J., Sassone, V., Sobociński, P. (2007). Semantic Barbs and Biorthogonality. In: Seidl, H. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2007. Lecture Notes in Computer Science, vol 4423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71389-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-71389-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71388-3
Online ISBN: 978-3-540-71389-0
eBook Packages: Computer ScienceComputer Science (R0)