Computing combinatorial types of trajectories in Pfaffian dynamics

DOI10.1016/j.jlap.2009.02.004zbMath1192.68450OpenAlexW2015070325MaRDI QIDQ1044670

Margarita Korovina, Nikolaj N. jun. Vorob'ev

Publication date: 18 December 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2009.02.004

zbMATH Keywords

dynamical systemso-minimalityPfaffian functions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Betti numbers of semialgebraic sets defined by quantifier-free formulae
• O-minimal hybrid systems.
• Hybrid Systems: Computation and Control
• Computer Science Logic
• Logical Approaches to Computational Barriers
• Viability theory
• Algorithms in real algebraic geometry
• Complexity of cylindrical decompositions of sub-Pfaffian
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing combinatorial types of trajectories in Pfaffian dynamics