A proof-theoretic view on scheduling in concurrency

Abstract : This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non-determinism as a fundamental feature, we develop a correspondence where proofs provide what is needed to make concurrent systems confluent, namely scheduling. In our logical system, processes and schedulers appear explicitly as proofs in different fragments of the proof language and cut elimination between them does correspond to execution of a concurrent system. This separation of roles suggests new insights for the denotational semantics of processes and new methods for the translation of pi-calculi into prefix-less formalisms (like solos) as the operational counterpart of translations between proof systems.
Type de document :
Communication dans un congrès
Paulo Oliva. Classical Logic and Computation 2014, Jul 2014, Wien, Austria. 164, pp.78-92, 2014, EPTCS. 〈10.4204/EPTCS.164.6〉
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00951976
Contributeur : Emmanuel Beffara <>
Soumis le : samedi 13 septembre 2014 - 14:19:41
Dernière modification le : samedi 13 septembre 2014 - 14:59:44
Document(s) archivé(s) le : dimanche 14 décembre 2014 - 10:23:42

Fichiers

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Emmanuel Beffara. A proof-theoretic view on scheduling in concurrency. Paulo Oliva. Classical Logic and Computation 2014, Jul 2014, Wien, Austria. 164, pp.78-92, 2014, EPTCS. 〈10.4204/EPTCS.164.6〉. 〈hal-00951976v4〉

Partager

Métriques

Consultations de la notice

199

Téléchargements de fichiers

112