A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems

Abstract : This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of preemption, and can be applied to the modelling of the semantics of high-level parallel programming languages with preemption-related features. As an illustration, the paper gives an application to the modelling of a multi-tasking system in a parallel programming language, which is provided with a concurrent semantics based on Petri nets and for which implemented tools can be used.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00114685
Contributor : Franck Pommereau <>
Submitted on : Friday, November 17, 2006 - 1:47:53 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 10:57:30 PM

File

2002-fi.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00114685, version 1

Collections

Citation

Hanna Klaudel, Franck Pommereau. A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2002, 50(1), pp.33-55. ⟨hal-00114685⟩

Share

Metrics

Record views

223

Files downloads

114