Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 53, Number 3-4, July–December 2019
Page(s) 153 - 206
DOI https://doi.org/10.1051/ita/2019005
Published online 10 January 2020
  1. M. Bundgaard, T. Hildebrandt and J.C. Godskesen, A cps encoding of name-passing in higher-order mobile embedded resources. Theor. Comput. Sci. 356 (2006) 422–439. [Google Scholar]
  2. A. Durier, D. Hirschkoff and D. Sangiorgi, Towards “up to context” reasoning about higher-order processes. Theor. Comput. Sci. DOI: 10.1016/j.tcs.2019.09.036 (2019). [PubMed] [Google Scholar]
  3. U.H. Engberg and M. Nielsen, A calculus of communicating systems with label passing. Tech. Rep. DAIMI PB-208, Computer Science Department, University of Aarhus (1986). [Google Scholar]
  4. U.H. Engberg and M. Nielsen, A calculus of communicating systems with label passing - ten years after. In Proof, Language, and Interaction: Essays in Honour of Robin Milner. MIT Press Cambridge (2000) 599–622. [Google Scholar]
  5. Y. Fu, On quasi open bisimulation. Theor. Comput. Sci. 338 (2005) 96–126. [Google Scholar]
  6. Y. Fu, Fair ambients. Acta Inform. 43 (2007) 535–594. [Google Scholar]
  7. Y. Fu, Theory of interaction. Theor. Comput. Sci. 611 (2015) 1–49. [Google Scholar]
  8. Y. Fu and H. Lu, On the expressiveness of interaction. Theor. Comput. Sci. 411 (2010) 1387–1451. [Google Scholar]
  9. D. Gorla, Towards a unified approach to encodability and separation results for process calculi. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008), vol. 5201 of Lecture Notes in Computer Science. Springer Verlag (2008) 492–507. [Google Scholar]
  10. D. Gorla, On the relative expressive power of calculi for mobility. Electr. Notes Theor. Comput. Sci. 249 (2009) 269–286. [CrossRef] [Google Scholar]
  11. D. Gorlaand U. Nestmann, Full abstraction for expressiveness: History, myths and facts. Math. Struct. Comput. Sci. 26 (2016) 639–654. [CrossRef] [Google Scholar]
  12. D. Kouzapas, J.A. Pérez and N. Yoshida, On the relative expressiveness of higher-order session processes. In Proceedings of the 25th European Symposium on Programming (ESOP 2016). In Vol. 9632 of Lecture Notes in Computer Science. Springer (2016) 446–475. [Google Scholar]
  13. I. Lanese, J. Pérez, D. Sangiorgi and A. Schmitt, On the expressiveness and decidability of higher-order process calculi. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008). IEEE Computer Society (2008) 145–155. [CrossRef] [Google Scholar]
  14. I. Lanese, J.A. Pérez, D. Sangiorgi and A. Schmitt, On the expressiveness of polyadic and synchronous communication in higher-order process calculi. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2010). In Vol. 6199 of Lecture Notes in Computer Science. Springer Verlag (2010) 442–453. [Google Scholar]
  15. I. Lanese, J.A. Pérez, D. Sangiorgi and A. Schmitt, On the expressiveness and decidability of higher-order process calculi. Inf. Comput. 209 (2011) 198–226. [Google Scholar]
  16. S. Lenglet, A. Schmitt and J.B. Stefani, Normal bisimulations in calculi with passivation. In: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2009). Vol. 5504 of Lecture Notes in Computer Science. Springer Verlag (2009) 257–271. [Google Scholar]
  17. S. Lenglet, A. Schmitt and J.B. Stefani, Characterizing contextual equivalence in calculi with passivation. Inf. Comput. 209 (2011) 1390–1433. [Google Scholar]
  18. J.M. Madiot, D. Pous and D. Sangiorgi, Bisimulations up-to: Beyond first-order transition systems. In: Proceedings of the 25th Conference on Concurrency Theory (CONCUR 2014). In Vol. 8704 of Lecture Notes in Computer Science. Springer Verlag (2014) 93–108. [Google Scholar]
  19. M. Merro and M. Hennessy, Bisimulation congruences in safe ambients. In: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 02). Portland, Oregon (2002) 71–80. [CrossRef] [Google Scholar]
  20. R. Milner, Communication and Concurrency. Prentice Hall (1989). [Google Scholar]
  21. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes (parts i and ii). Inf. Comput. 100 (1992) 1–77. [Google Scholar]
  22. J. Parrow, General conditions for full abstraction. Math. Struct. Comput. Sci. 26 (2016) 655–657. [CrossRef] [Google Scholar]
  23. D. Pous and D. Sangiorgi, Enhancements of the bisimulation proof method, chap. Enhancements of the coinductive proof method. Cambridge University Press (2011). [Google Scholar]
  24. D. Sangiorgi, Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. thesis, University of Edinburgh (1992). [Google Scholar]
  25. D. Sangiorgi, Bisimulation for higher-order process calculi. Inf. Comput. 131 (1996) 141–178. [Google Scholar]
  26. D. Sangiorgi, On the bisimulation proof method. Math. Struct. Comput. Sci. 8 (1998) 447–479. [CrossRef] [Google Scholar]
  27. D. Sangiorgi, Introduction to Bisimulation and Coinduction. Cambridge University Press (2011). [Google Scholar]
  28. D. Sangiorgi, Concurrency theory: timed automata, testing, program synthesis. Distrib. Comput. 25 (2012) 3–4. [Google Scholar]
  29. D. Sangiorgi, N. Kobayashi and E. Sumii, Environmental bisimulations for higher-order languages. ACM Trans. Prog. Lang. Syst. 33 (2011) 5. [CrossRef] [Google Scholar]
  30. D. Sangiorgi and J. Rutten, Advanced Topics in Bisimulation and Coinduction. Cambridge University Press (2012). [Google Scholar]
  31. D. Sangiorgi and D. Walker, The Pi-calculus: a Theory of Mobile Processes. Cambridge University Press (2001). [Google Scholar]
  32. B. Thomsen, Calculi for higher order communicating systems. Ph.D. thesis, Department of Computing, Imperial College (1990). [Google Scholar]
  33. B. Thomsen, Plain CHOCS, a second generation calculus for higher-order processes. Acta Inf. 30 (1993) 1–59. [CrossRef] [Google Scholar]
  34. X. Xu, Higher-order processes with parameterization over names and processes. In: Proceedings of Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics (EXPRESS/2016), EPTCS 222 (2016) 15–29. [Google Scholar]
  35. X. Xu, Distinguishing and relating higher-order and first-order processes by expressiveness. Acta In. 49 (2012) 445–484. [Google Scholar]
  36. X. Xu, On context bisimulation for parameterized higher-order processes. In: Proceedings of the 6th Interaction and Concurrency Experience (ICE 2013), EPTCS 131 (2013) 37–51. [Google Scholar]
  37. X. Xu, Q. Yin and H. Long, On the computation power of name parameterization in higher-order processes. In: Proceedings of 8th Interaction and Concurrency Experience (ICE 2015). EPTCS 189 (2015) 114–127. [Google Scholar]
  38. Q. Yin, X. Xu and H. Long, On parameterization of higher-order processes. Int. J. Comput. Math. 7(94) (2017) 1451–1478. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.