Satisfiability of viability constraints for Pfaffian dynamics

Authors:
Margarita Korovina;Nicolai Vorobjov
Affiliations:
Fachbereich Mathematik, Universität Siegen, Germany and IIS SB RAS, Novosibirsk, Russia;Department of Computer Science, University of Bath, England
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 3
Cited 0

Complexity and real computation

Complexity and real computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Upper and lower bounds on sizes of finite bisimulations of pfaffian hybrid systems

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the behavior of a Pfaffian dynamical system with respect to viability constraints and invariants. For Pfaffian dynamical systems we construct an algorithm with an elementary (doubly-exponential) upper complexity bound for checking satisfiability of viability constraints. This algorithm also provides a useful tool for checking invariance properties of given sets.