The linear reachability problem is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using results on minimal solutions (in nonnegative integers) for linear Diophantine systems, we obtain new complexity results for the problem, as well as for other linear counting problems of finite state transition systems and timed automata. In contrast to previously known results, the complexity bounds obtained in this paper are polynomial in the size of the transition system in consideration, when the linear constraint is fixed. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Xie, G., Li, C., & Dang, Z. (2003). New complexity results for some linear counting problems using minimal solutions to linear diophantine equations (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759, 163–175. https://doi.org/10.1007/3-540-45089-0_16
Mendeley helps you to discover research relevant for your work.