#### Filter Results:

#### Publication Year

1997

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same problem for a transition system associated with a continuous dynamical system. It was recently proved by several authors that under certain natural assumptions such finite… (More)

In this paper we study Pfaffian hybrid systems which were first introduced in [9]. Pfaffian hybrid systems are a sub-class of o-minimal hybrid systems which capture rich continuous dynamics and yet can be studied using finite bisimulations. The existence of finite bisimulations for o-minimal hybrid systems has been shown by several authors (see e.g. [2, 3,… (More)

- Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker, Erika Abraham, Andreas Grüner +9 others
- 2007

We consider the solution of initial value problems within the context of hybrid systems and emphasise the use of high precision approximations (in software for exact real arithmetic). We propose a novel algorithm for the computation of trajectories up to the area where discontinuous jumps appear, applicable for holomorphic flow functions. Examples with a… (More)

- Margarita V. Korovina, Oleg V. Kudinov
- CSL
- 1998

Characteristic properties of majorant-computable real-valued functions are studied. A formal theory of computability over the reals which satisses the requirements of numerical analysis used in Computer Science is constructed on the base of the deenition of majorant-computa-bility proposed in 13]. A model-theoretical characterization of… (More)

- Margarita V. Korovina, Oleg V. Kudinov
- Electr. Notes Theor. Comput. Sci.
- 2008

- Margarita V. Korovina
- CSL
- 2003

- Margarita V. Korovina, Nicolai Vorobjov
- J. Log. Algebr. Program.
- 2010

- Margarita V. Korovina
- Electr. Notes Theor. Comput. Sci.
- 2002

This work is the next step in a series of papers [3, 4] using arguments from definability theory to logically characterise computable continuous data. In order to do this we have proposed the notion of majorant-computability and developed logical approach to computability over continuous data. This approach is based on representations of continuous data by… (More)