Towards a certified petri net model-checker

Authors:
Lukasz Fronc;Franck Pommereau
Affiliations:
IBISC, University of Évry, Évry, France;IBISC, University of Évry, Évry, France
Venue:
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Year:
2011

Citing 3
Cited 0

Reflecting BDDs in Coq

ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Haskell-Coloured Petri Nets

IFL '99 Selected Papers from the 11th International Workshop on Implementation of Functional Languages
Coloured Petri Nets: Modelling and Validation of Concurrent Systems

Coloured Petri Nets: Modelling and Validation of Concurrent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Petri nets are widely used in the domain of automated verification through model-checking. In this approach, a Petri Net model of the system of interest is produced and its reachable states are computed, searching for erroneous executions. Model compilation can accelerate this analysis by generating code to explore the reachable states. This avoids the use of a fixed exploration tool involving an "interpretation" of the Petri net structure. In this paper, we show how to compile Petri nets targeting the LLVM language (a high-level assembly language) and formally prove the correctness of the produced code. To this aim, we define a structural operational semantics for the fragment of LLVM we use.