A concurrent semantics of static exceptions in a parallel programming language
Résumé
This paper aims at introducing a mechanism of exceptions in a parallel programming language, giving them a formal concurrent semantics in terms of preemptible and composable high-level Petri nets. We show that, combined with concurrency, exceptions can be used as a basis for other preemption related constructs. We illustrate this idea by presenting a generalized timeout and a simple UNIX-like system of concurrent preemptible threads.
Domaines
Modélisation et simulationOrigine | Fichiers éditeurs autorisés sur une archive ouverte |
---|