Computability in Europe 2006
Logical Approaches to Computational Barriers


Regular Talk:
Safety Properties Verification for Pfaffian Dynamics


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