Decidable Fragments of a Higher Order Calculus with Locations

Electronic Notes in Theoretical Computer Science

Volumn 242, Issue 1, 2009, Pages 113-138

  Bundgaard, Mikkel ^a   Godskesen, Jens Chr ^a   Haagensen, Bjørn ^b   Hüttel, Hans ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

Decidability; higher order process passing; locations; semantic finite control

Indexed keywords

BISIMILARITY; DECIDABILITY; FINITE CONTROL; HIGHER ORDER PROCESS PASSING; HIGHER-ORDER CALCULUS; HIGHER-ORDER PROCESS; REACHABILITY; TYPE SYSTEMS;

CALCULATIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); SEMANTICS;

COMPUTABILITY AND DECIDABILITY;

EID: 67649635315     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.06.016     Document Type: Article

References (18)

1. Bundgaard M., Hildebrandt T., and Godskesen J.C. A CPS encoding of name-passing in higher-order mobile embedded resources. Theoretical Computer Science 356 (2006) 422-439
2. Bundgaard, M., T. Hildebrandt and J. C. Godskesen, On encoding the π-calculus in higher-order calculi, Technical Report TR-2008-106, IT University of Copenhagen (2008)
3. Busi N., and Zavattaro G. On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science 322 (2004) 477-515
4. Cardelli L., and Gordon A.D. Mobile ambients. Theoretical Computer Science 240 (2000) 177-213
5. Charatonik W., Gordon A.D., and Talbot J.-M. Finite-control mobile ambients. Proceedings of the 11th European Symposium on Programming (ESOP'02). Lecture Notes in Computer Science vol. 2305 (2002) 295-313
6. Dam M. On the decidability of process equivalences for the π-calculus. Theoretical Computer Science 183 (1997) 215-228
7. Godskesen J.C., and Hildebrandt T. Extending Howe's method to early bisimulations for typed mobile embedded resources with local names. Proceedings of the 25th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05). Lecture Notes in Computer Science vol. 3821 (2005) 140-151
8. Gorla D. Towards a unified approach to encodability and separation results for process calculi. Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08). Lecture Notes in Computer Science vol. 5201 (2008) 492-507
9. Hildebrandt, T., J. C. Godskesen and M. Bundgaard, Bisimulation congruences for Homer - a calculus of higher order mobile embedded resources, Technical Report TR-2004-52, IT University of Copenhagen (2004)
10. Lanese I., Pérez J.A., Sangiorgi D., and Schmitt A. On the expressiveness and decidability of higher-order process calculi. Proceedings of the 23th Annual IEEE Symposium on Logic in Computer Science (LICS'08) (2008) 145-155
11. Maffeis S., and Phillips I. On the computational strength of pure ambient calculi. Theoretical Computer Science 330 (2005) 501-551
12. Milner R. A Calculus of Communicating Systems. Lecture Notes in Computer Science vol. 92 (1980), Springer Verlag
13. Milner R. Communicating and Mobile Systems: the π-calculus (1999), Cambridge University Press
14. Minsky M. Computation: Finite and infinite machines (1967), Prentice-Hall
15. Sangiorgi, D., "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis, University of Edinburgh, Dept. of Computer Science (1993)
16. Sangiorgi D., and Walker D. The π-Calculus: a Theory of Mobile Processes (2001), Cambridge University Press
17. Thomsen B. Plain CHOCS: A second generation calculus for higher order processes. Acta Informatica 30 (1993) 1-59
18. Zimmer P. On the expressiveness of pure safe ambients. Mathematical Structures in Computer Science 13 (2004) 721-770