Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Safety Properties Verification for Pfaffian Dynamics

Edit abstract data

THIS TALK HAS BEEN CANCELLED!!!
Author(s): Margarita Korovina and Nicolai Vorobjov

Abstract

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 Valid HTML 4.01! Valid CSS!