Bounds on sizes of finite bisimulations of Pfaffian dynamical systems

DOI10.1007/S00224-007-9019-4MaRDI QIDQ1015374zbMATH OpenOpenAlexFDO

Authors M. V. Korovina, Nicolai Vorobjov

Publication date 8 May 2009

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL http://eprints.maths.manchester.ac.uk/1380/1/jtcs_08_korvor.pdf

zbMATH Keywords

bisimulationdynamical systemhybrid systemsemialgebraic geometry

Mathematics Subject Classification ID

Model theory of ordered structures; o-minimality (03C64) Real-analytic and semi-analytic sets (14P15) Symbolic dynamics (37B10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Logical Approaches to Computational Barriers
• Computer Science Logic
• Words and bisimulations of dynamical systems
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control

Cites work

• Algorithms in real algebraic geometry
• Betti numbers of semi-Pfaffian sets
• BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
• Complexity of stratifications of semi-Pfaffian sets
• Computer Science Logic
• Differential Topology
• scientific article; zbMATH DE number 49719 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• Logical Approaches to Computational Barriers
• O-minimal hybrid systems.
• Semialgebraic Sard theorem for generalized critical values.
• Topologies, Continuity and Bisimulations

Cited in

(5)

• Computing combinatorial types of trajectories in Pfaffian dynamics
• Finite bisimulations for dynamical systems with overlapping trajectories
• Computer Science Logic
• Words and bisimulations of dynamical systems
• Logical Approaches to Computational Barriers

This page was built for publication: Bounds on sizes of finite bisimulations of Pfaffian dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015374)