Coloured Petri net refinement specification and correctness proof with Coq

Authors:
Christine Choppy;Micaela Mayero;Laure Petrucci
Affiliations:
LIPN, UMR CNRS 7030, Villetaneuse, France;LIPN, UMR CNRS 7030, Villetaneuse, France;LIPN, UMR CNRS 7030, Villetaneuse, France
Venue:
Innovations in Systems and Software Engineering
Year:
2010

Citing 8
Cited 0

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
A New Definition of the Subtype Relation

ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Incremental State Space Construction for Coloured Petri Nets

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Experimenting Formal Proofs of Petri Nets Refinements

Electronic Notes in Theoretical Computer Science (ENTCS)
Coloured Petri Nets: Modelling and Validation of Concurrent Systems

Coloured Petri Nets: Modelling and Validation of Concurrent Systems
Efficient state-based analysis by introducing bags in Petri nets color domains

ACC'09 Proceedings of the 2009 conference on American Control Conference
Composing abstractions of coloured Petri nets

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
The Petri net markup language: concepts, technology, and tools

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we address the issue of the formal proof (using the proof assistant Coq) of refinement correctness for symmetric nets, a subclass of coloured Petri nets. We provide a formalisation of the net models, and of their type refinement in Coq. Then the Coq proof assistant is used to prove the refinement correctness lemma. An example adapted from a protocol example illustrates our work.