Computability in Europe 2008
Logic and Theory of Algorithms
|THIS TALK HAS BEEN CANCELLED!!!|
|Author(s):||Margarita Korovina and Nicolai Vorobjov|
In this paper we propose an algorithm for verification of safety properties of Pfaffian dynamical systems. We also show that this algorithm has an elementary (doubly-exponential) upper complexity bound.
|websites: Arnold Beckmann||2008-05-30|