Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
The logic of event clocks: decidability, complexity and expressiveness
Automatica (Journal of IFAC)
Hi-index | 0.01 |
The formalism of hybrid functional petri nets (HFPN) has proved its convenience for simulating biological systems. The drawback of the noticeable expressiveness of HFPN is the difficulty to perform formal verifications of dynamical properties. In this article, we propose a model-checking procedure for timed hybrid petri nets (THPN), a sub-class of HFPN. This procedure is based on the translation of the THPN model and of the studied property into real-time automata. It is applied to model enzymatic competitions existing in amphibian metamorphosis.