State splitting and state merging in probabilistic finite state automata

Patrick Adenis, Kushal Mukherjee, Asok Ray

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations

    Abstract

    Probabilistic finite state automata (PFSA) are constructed from symbol sequences for modeling the behavior of dynamical systems. This paper presents construction of finite history automata from symbol sequences; such automata, called D-Markov machines, are structurally simple and computationally efficient. The construction procedure is based on: (i) state splitting that generates symbol blocks of different lengths according to their relative importance; and (ii) state merging that assimilates histories from symbol blocks leading to the same symbolic behavior. A metric on probability distribution of symbol blocks is introduced for trade-off between modeling performance and the number of PFSA states. These algorithms have been tested by two examples.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 2011 American Control Conference, ACC 2011
    Pages5145-5150
    Number of pages6
    StatePublished - Sep 29 2011
    Event2011 American Control Conference, ACC 2011 - San Francisco, CA, United States
    Duration: Jun 29 2011Jul 1 2011

    Other

    Other2011 American Control Conference, ACC 2011
    CountryUnited States
    CitySan Francisco, CA
    Period6/29/117/1/11

      Fingerprint

    All Science Journal Classification (ASJC) codes

    • Electrical and Electronic Engineering

    Cite this

    Adenis, P., Mukherjee, K., & Ray, A. (2011). State splitting and state merging in probabilistic finite state automata. In Proceedings of the 2011 American Control Conference, ACC 2011 (pp. 5145-5150). [5990861]