Sanja Zivanovic Gonzalez

dblp:60/9187 · also Sanja Zivanovic · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 since 2021Software engineering, systems software and programming languages · 1
YearPublicationVenuePosition
2025 Rigorous Function Calculi in Ariadne
abstract
Almost all problems in applied mathematics, including the analysis of dynamical systems, deal with spaces of real-valued functions on Euclidean domains in their formulation and solution. In this paper, we describe the the tool Ariadne, which provides a rigorous calculus for working with Euclidean functions. We first introduce the Ariadne framework, which is based on a clean separation of objects as providing exact, effective, validated and approximate information. We then discuss the function calculus as implemented in Ariadne, including polynomial function models which are the fundamental class for concrete computations. We then consider solution of some core problems of functional analysis, namely solution of algebraic equations and differential equations, and briefly discuss their use for the analysis of hybrid systems. We will give examples of C++ and Python code for performing the various calculations. Finally, we will discuss progress on extensions, including improvements to the function calculus and extensions to more complicated classes of system.
Pieter Collins, Luca Geretti, Sanja Zivanovic Gonzalez, Davide Bresolin, Tiziano Villa
Log. Methods Comput. Sci.3
2024 A computable and compositional semantics for hybrid systems
Davide Bresolin, Pieter Collins, Luca Geretti, Roberto Segala, Tiziano Villa, Sanja Zivanovic Gonzalez
Inf. Comput.6
2020 A computable and compositional semantics for hybrid automata
abstract
Hybrid Systems are systems having a mixed discrete and continuous behaviour that cannot be characterized faithfully using either only discrete or only continuous models. A good framework for hybrid systems should support their compositional description and analysis, since commonly systems are specified by a composition of smaller subsystems, to cope with the complexity of their monolithic representation. Moreover, since the reachability problem for hybrid systems is undecidable, one should investigate the conditions that guarantee approximate computability of composition, when only approximations to the exact problem data are available.
Davide Bresolin, Pieter Collins, Luca Geretti, Roberto Segala, Tiziano Villa, Sanja Zivanovic Gonzalez
HSCC6
2017 Ongoing Work on Automated Verification of Noisy Nonlinear Systems with Ariadne
Luca Geretti, Davide Bresolin, Pieter Collins, Sanja Zivanovic Gonzalez, Tiziano Villa
ICTSS4