Computation of maximal reachability submodules

Computation of maximal reachability submodules

A new and conceptually simple procedure is derived for the computation of the maximal reachability submodule of a given submodule of the state space of a linear discrete time system over a Noethenian ring R. The procedure is effective if R is effective and if kernels and intersections can be computed. The procedure is compared with a rather different procedure by Assan e.a. published recently.

Symbolic Computation of Maximal Probabilistic Reachability

We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems. We extend the framework of symbolic transition systems, which equips...

Projective maximal submodules of extending regular modules

We show  that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. Hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. As aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. This generalizes and simplifies a result of  Dung and   Smith. As another consequen...

Symbolic computation of reachability

projective maximal submodules of extending regular modules

we show  that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. as aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. this generalizes and simplifies a result of  dung and   smith. as another consequen...