Skip to Main content Skip to Navigation
Conference papers

{Compositional Analysis of Discrete Time Petri nets}

Abstract : Symbolic BDD-based verification techniques successfully tackle combinatorial explosion in many cases. However, the models to be verified become increasingly larger and more complex, including - for instance - additional features like quantitative requirements and/or a very high number of components. The need to improve performances for verification tools thus remains a challenge. In this work, we extend the framework of Instantiable Transition Systems in order to (i) take into account time constraints in a model and (ii) capture the symmetry of instances which share a common structure, thus significantly increasing the power of our tool. For point (i), we implement timed models with discrete time semantics and for (ii), we introduce scalar sets as a special form of composition. We also report on experiments including comparisons with other tools. The results show a good scale up for our approach.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Thursday, March 3, 2016 - 5:06:36 PM
Last modification on : Saturday, May 16, 2020 - 4:24:02 PM


  • HAL Id : hal-01282489, version 1


Yann Thierry-Mieg, Béatrice Bérard, Fabrice Kordon, Didier Lime, Olivier Henri Roux. {Compositional Analysis of Discrete Time Petri nets}. 1st workshop on Petri Nets Compositions (CompoNet 2011), Jun 2011, Newcastle, United Kingdom. pp.17-31. ⟨hal-01282489⟩



Record views