Perez - Parra, Jorge Andres
(2010)
Higher-Order Concurrency: Expressiveness and Decidability Results
, [Dissertation thesis], Alma Mater Studiorum Università di Bologna.
Dottorato di ricerca in
Informatica, 22 Ciclo. DOI 10.6092/unibo/amsdottorato/2285.
Documenti full-text disponibili:
Abstract
Higher-order process calculi are formalisms for concurrency in which processes can be passed around in communications. Higher-order (or process-passing) concurrency is often presented as an alternative paradigm to the first order (or name-passing) concurrency of the pi-calculus for the description of mobile systems. These calculi are inspired by, and formally close to, the lambda-calculus, whose basic computational step ---beta-reduction--- involves term instantiation.
The theory of higher-order process calculi is more complex than that of first-order process calculi. This shows up in, for instance, the definition of behavioral equivalences. A long-standing approach to overcome this burden is to define encodings of higher-order processes into a first-order setting, so as to transfer the theory of the first-order paradigm to the higher-order one. While satisfactory in the case of calculi with basic (higher-order) primitives, this
indirect approach falls short in the case of higher-order process calculi featuring constructs for phenomena such as, e.g., localities and dynamic system reconﬁguration, which are frequent in modern distributed systems. Indeed, for higher-order process calculi involving little more
than traditional process communication, encodings into some first-order language are difficult to handle or do not exist. We then observe that foundational studies for higher-order process calculi must be carried out directly on them and exploit their peculiarities.
This dissertation contributes to such foundational studies for higher-order process calculi. We concentrate on two closely interwoven issues in process calculi: expressiveness and decidability. Surprisingly, these issues have been little explored in the higher-order setting. Our
research is centered around a core calculus for higher-order concurrency in which only the operators strictly necessary to obtain higher-order communication are retained. We develop the basic theory of this core calculus and rely on it to study the expressive power of issues
universally accepted as basic in process calculi, namely synchrony, forwarding, and polyadic communication.
Abstract
Higher-order process calculi are formalisms for concurrency in which processes can be passed around in communications. Higher-order (or process-passing) concurrency is often presented as an alternative paradigm to the first order (or name-passing) concurrency of the pi-calculus for the description of mobile systems. These calculi are inspired by, and formally close to, the lambda-calculus, whose basic computational step ---beta-reduction--- involves term instantiation.
The theory of higher-order process calculi is more complex than that of first-order process calculi. This shows up in, for instance, the definition of behavioral equivalences. A long-standing approach to overcome this burden is to define encodings of higher-order processes into a first-order setting, so as to transfer the theory of the first-order paradigm to the higher-order one. While satisfactory in the case of calculi with basic (higher-order) primitives, this
indirect approach falls short in the case of higher-order process calculi featuring constructs for phenomena such as, e.g., localities and dynamic system reconﬁguration, which are frequent in modern distributed systems. Indeed, for higher-order process calculi involving little more
than traditional process communication, encodings into some first-order language are difficult to handle or do not exist. We then observe that foundational studies for higher-order process calculi must be carried out directly on them and exploit their peculiarities.
This dissertation contributes to such foundational studies for higher-order process calculi. We concentrate on two closely interwoven issues in process calculi: expressiveness and decidability. Surprisingly, these issues have been little explored in the higher-order setting. Our
research is centered around a core calculus for higher-order concurrency in which only the operators strictly necessary to obtain higher-order communication are retained. We develop the basic theory of this core calculus and rely on it to study the expressive power of issues
universally accepted as basic in process calculi, namely synchrony, forwarding, and polyadic communication.
Tipologia del documento
Tesi di dottorato
Autore
Perez - Parra, Jorge Andres
Supervisore
Dottorato di ricerca
Scuola di dottorato
Scienze e ingegneria dell'informazione
Ciclo
22
Coordinatore
Settore disciplinare
Settore concorsuale
Parole chiave
concurrency theory, process calculi, higher-order communication, expressiveness, decidability.
URN:NBN
DOI
10.6092/unibo/amsdottorato/2285
Data di discussione
5 Maggio 2010
URI
Altri metadati
Tipologia del documento
Tesi di dottorato
Autore
Perez - Parra, Jorge Andres
Supervisore
Dottorato di ricerca
Scuola di dottorato
Scienze e ingegneria dell'informazione
Ciclo
22
Coordinatore
Settore disciplinare
Settore concorsuale
Parole chiave
concurrency theory, process calculi, higher-order communication, expressiveness, decidability.
URN:NBN
DOI
10.6092/unibo/amsdottorato/2285
Data di discussione
5 Maggio 2010
URI
Statistica sui download
Gestione del documento: