We consider weighted finite transition systems with weights from naturally ordered semirings. Such semirings comprise distributive lattices as well as the natural numbers with ordinary addition and multiplication, and the max -plus-semiring. For these systems we explore the concepts of covering and cascade product. We show a cascade decomposition result for such weighted finite transition systems using special partitions of the state set of the system. This extends a classical result of automata theory to the weighted setting. © 2011 Springer-Verlag.
CITATION STYLE
Droste, M., Meinecke, I., Šešelja, B., & Tepavčević, A. (2011). A cascade decomposition of weighted finite transition systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 472–473). https://doi.org/10.1007/978-3-642-22321-1_43
Mendeley helps you to discover research relevant for your work.