pyHybrid Analysis: A Package for Semantics Analysis of Hybrid Systems. Hybrid automata naturally represent systems that exhibit a mixed discrete-continuous behaviours. The undecidability of the reach ability problem over them constrains the chances of punctually investigating this kind of formalism. Established that this negative result and the presence of artifacts, which do not correspond to any observable phenomena, are mainly due to the density of the continuous domain, a class of finite precision semantics, named [epsilon]-semantics, has been proposed to analyze hybrid automata. This paper presents a Python package, pyHybrid Analysis, that both implements the [epsilon]-semantics framework and allows to analyze hybrid automata.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Dreossi, Tommaso; Dang, Thao; Piazza, Carla: Reachability computation for polynomial dynamical systems (2017)
- Casagrande, A.; Dreossi, T.; Fabriková, J.; Piazza, C.: $\epsilon$-semantics computations on biological systems (2014)