Korovina, Margarita and Vorobjov, Nicolai
(2010)
*Computing combinatorial types of trajectories in Pfaffian Dynamics.*
Journal of Logic and Algebraic Programming, 79 (1).
pp. 32-37.
ISSN 1567-8326

PDF
jlap_2010.pdf Download (138kB) |

## Abstract

Suppose that the state space of a dynamical system has a finite partition, and each element of the partition is labelled by a letter of some alphabet. Then every trajectory of the system is naturally labelled by a word in this alphabet. This word is called the combinatorial type of the trajectory. In applications it is important to decide whether among a certain family of trajectories there is at least one trajectory of a given type, or whether all the trajectories in this family have the same type. In this paper we construct algorithms for solving this sort of questions for a wide class of Pfaffian dynamical systems, which have elementary (doubly-exponential) upper complexity bounds.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | CICADA |

Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 03 Mathematical logic and foundations MSC 2010, the AMS's Mathematics Subject Classification > 37 Dynamical systems and ergodic theory MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science |

Depositing User: | Dr Margarita Korovina |

Date Deposited: | 26 May 2010 |

Last Modified: | 20 Oct 2017 14:12 |

URI: | https://eprints.maths.manchester.ac.uk/id/eprint/1458 |

## Actions (login required)

View Item |