Discrete abstraction of multiaffine systems LNCS Kong, Hui ; https://orcid.org/0000-0002-3066-6941 Bartocci, Ezio Bogomolov, Sergiy ; https://orcid.org/0000-0002-0686-0365 Grosu, Radu Henzinger, Thomas A ; https://orcid.org/0000−0002−2985−7724 Jiang, Yu Schilling, Christian ; https://orcid.org/0000-0003-3658-1065 ddc:005 Many biological systems can be modeled as multiaffine hybrid systems. Due to the nonlinearity of multiaffine systems, it is difficult to verify their properties of interest directly. A common strategy to tackle this problem is to construct and analyze a discrete overapproximation of the original system. However, the conservativeness of a discrete abstraction significantly determines the level of confidence we can have in the properties of the original system. In this paper, in order to reduce the conservativeness of a discrete abstraction, we propose a new method based on a sufficient and necessary decision condition for computing discrete transitions between states in the abstract system. We assume the state space partition of a multiaffine system to be based on a set of multivariate polynomials. Hence, a rectangular partition defined in terms of polynomials of the form (xi − c) is just a simple case of multivariate polynomial partition, and the new decision condition applies naturally. We analyze and demonstrate the improvement of our method over the existing methods using some examples. Springer 2016 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/1227 https://research-explorer.ista.ac.at/download/1227/4840 Kong H, Bartocci E, Bogomolov S, et al. Discrete abstraction of multiaffine systems. In: Vol 9957. Springer; 2016:128-144. doi:<a href="https://doi.org/10.1007/978-3-319-47151-8_9">10.1007/978-3-319-47151-8_9</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-47151-8_9 info:eu-repo/semantics/altIdentifier/wos/000389928100009 info:eu-repo/semantics/openAccess