Optimising the compilation of Petri net models - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Optimising the compilation of Petri net models

(1) , (1)
1

Abstract

Compilation of a Petri net model is one way to accelerate its veri cation through state space exploration. In this approach, code to explore the Petri net is generated, which avoids the use a xed exploration tool involving an interpretation" of the Petri net structure. In this paper, we show how peculiarities in the model (like places types, boundedness, invariants, etc., known by construction if adequate modelling tools are used) can be exploited to improve the generated code e ciency. We present a lightweight code generation framework targeting the LLVM language and demonstrate its exibility by considering several kinds of optimisations. Our compiler is called lightweight because the annotations of the compiled models are directly expressed in the target language, which saves from translating them and allows for fast compilation. The accelerations resulting from the optimisations are then evaluated on various Petri net models, showing important speedups and in some cases outperforming state-of-the-art tools.
Fichier principal
Vignette du fichier
sumo2011.pdf (206.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00666661 , version 1 (29-11-2013)

Identifiers

  • HAL Id : hal-00666661 , version 1

Cite

Lukasz Fronc, Franck Pommereau. Optimising the compilation of Petri net models. Second International Workshop on Scalable and Usable Model Checking for Petri Net and other models of Concurrency (SUMO 2011), Jun 2011, Kanazawa, Japan. pp.49--64. ⟨hal-00666661⟩
126 View
164 Download

Share

Gmail Facebook Twitter LinkedIn More