|
|
Welcome |
|
|
Teaching |
|
|
Research |
|
|
Projects |
|
|
CV |
|
|
Contact info |
|
|
Other stuff |
|
|
Links |
The development of formal methods and theories for the construction and analysis of concurrent systems has been a subject of increased interest, particularly in the last decade. Amongst the most recognized and studied theories is the pi-calculus and its family of languages. The pi-calculus is a language for describing and reasoning about mobile systems, that is, systems in which the topology of the communications network is dynamic and not fixed a priori. Examples of such systems include mobile phone networks and the TCP/IP protocol that underlies the Internet. Another paradigm for concurrency is known as Concurrent Constraint Programming or CCP for short. This is a particularly attractive model because of its close ties with Logic and its declarative style. In this thesis a survey of the pi-calculus family and the CCP family is presented, emphasizing the relations both within each family and between the two paradigms. In particular we explore the question of whether CCP supports mobility. The main contribution is the establishment of a gap in expressiveness between CCP and the pi-calculus in that the core CCP is unable to model internal mobility.
The complete thesis is available in the following formats: