Membership and Reachability Problems for Row-Monomial Transformations

In this paper we study the membership and vector reachability problems for labelled transition systems with row-monomial transformations. We show the decidability of these problems for row-monomial martix semigroups over rationals and extend these results to the wider class of matrix semigroups. After that we apply our methods to reachability problems for a class of transition systems which turn out to be equivalent to specific counter machines.

[1]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[2]  Juhani Karhumäki,et al.  Combinatorics on words: a tutorial , 2003, Bull. EATCS.

[3]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[4]  Evelyne Contejean,et al.  Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables , 1995, CP.

[5]  Juhani Karhumäki,et al.  Examples of Undecidable Problems for 2-Generator Matrix Semigroups , 1998, Theor. Comput. Sci..

[6]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[7]  A. Clifford,et al.  The Algebraic Theory of Semigroups, Volume I , 1961 .

[8]  Jin-Yi Cai,et al.  Multiplicative equations over commuting matrices , 1996, SODA '96.

[9]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[10]  Tero Harju,et al.  Mortality in Matrix Semigroups , 2001, Am. Math. Mon..

[11]  Alain Finkel,et al.  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols , 2002, FSTTCS.

[12]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[13]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[14]  Evelyne Contejean,et al.  An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations , 1994, Inf. Comput..

[15]  M. Paterson.  Unsolvability in 3 × 3 Matrices , 1970 .

[16]  Richard J. Lipton,et al.  The complexity of the membership problem for 2-generated commutative semigroups of rational matrices , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.