The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The Petri net markup language: concepts, technology, and tools
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Coloured Petri net refinement specification and correctness proof with Coq
Innovations in Systems and Software Engineering
PNML framework: an extendable reference implementation of the petri net markup language
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once validated, a refinement step takes place, enhancing some parts of the initial model so as to obtain a more concrete specification. Some refinement techniques have been proposed in the framework of high-level Petri nets. Up to now, proving that a concrete net refines an abstract one, i.e. that there is a refinement relation between them, is completely manual. Our work aims at proving the refinement relation between two nets, both formally and automatically. For that purpose, we use the Coq theorem prover. We aim at having a framework general and parameterised enough to use Coq for any input nets. Moreover, this work constitutes a stepping stone towards bridging the gap between Petri nets and proof assistants techniques, and we claim that theorem proving methods are appropriate to prove the correctness of Petri net refinement.