2010.41: Computing combinatorial types of trajectories in Pfaffian Dynamics

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

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 136 Kb

DOI: doi:10.1016/j.jlap.2009.02.004

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.

Download Statistics: last 4 weeks
Repository Staff Only: edit this item