Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations. (February 2021)

• Record Type: Journal Article
• Authors: Lavaei, Abolfazl; Soudjani, Sadegh; Zamani, Majid
• Is Part Of: Nonlinear analysis. Volume 39(2021)
• Publication Date: 2021-02
• Subjects: Compositional abstraction-based synthesis -- General Markov decision processes -- Approximate probabilistic relations -- Abstract models -- Policy refinement; Nonlinear functional analysis -- Periodicals; Analyse fonctionnelle non linéaire -- Périodiques; Nonlinear functional analysis; Periodicals; 515.7248
• DOI: 10.1016/j.nahs.2020.100991
• Languages: English
• ISSNs: 1751-570X

Abstract

Abstract: We propose a compositional approach for constructing abstractions of general Markov decision processes (gMDPs) using approximate probabilistic relations. The abstraction framework is based on the notion of δ -lifted relations, using which one can quantify the distance in probability between the interconnected gMDPs and that of their abstractions. This new approximate relation unifies compositionality results in the literature by incorporating the dependencies between state transitions explicitly and by allowing abstract models to have either infinite or finite state spaces. Accordingly, one can leverage the proposed results to perform analysis and synthesis over abstract models, and then carry the results over concrete ones. To this end, we first propose our compositionality results using the new approximate probabilistic relation which is based on lifting. We then focus on a class of stochastic nonlinear dynamical systems and construct their abstractions using both model order reduction and space discretization in a unified framework. We provide conditions for simultaneous existence of relations incorporating the structure of the network. Finally, we demonstrate the effectiveness of the proposed results by considering a network of four nonlinear dynamical subsystems (together 12 dimensions) and constructing finite abstractions from their reduced-order versions (together 4 dimensions) in a unified compositional framework. We benchmark our results against the compositional abstraction techniques that construct both infinite abstractions (reduced-order models) and finite MDPs in two consecutive steps. We show that our approach is less conservative than the ones available in the literature.