Cartesian product partitioning of multi-dimensional reachable state spaces

DOI10.1017/S0269964816000085MaRDI QIDQ5358087zbMATH OpenOpenAlexFDO

Authors Tuugrul Dayar, M. Can Orhan

Publication date 19 September 2017

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/s0269964816000085

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 279297
• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
• Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
• A Symbolic Algorithm for Optimal Markov Chain Lumping
• Kronecker modeling and analysis of multidimensional Markovian systems

Cites work

• Analyzing Markov chains using Kronecker products. Theory and applications
• Cartesian product partitioning of multi-dimensional reachable state spaces
• Comparison of multilevel methods for Kronecker-based Markovian representations
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303061 (Why is no real title available?)
• scientific article; zbMATH DE number 729460 (Why is no real title available?)
• scientific article; zbMATH DE number 1424299 (Why is no real title available?)
• Introduction to algorithms.
• Lectures on Polytopes
• Minimal rectangular partitions of digitized blobs
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Note on induced subgraphs of the unit distance graph \(E^ n\)
• PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Structured analysis approaches for large Markov chains
• Three Partition Refinement Algorithms

Cited in

(2)

• On vector-Kronecker product multiplication with rectangular factors
• Cartesian product partitioning of multi-dimensional reachable state spaces

Describes a project that uses

Uses Software

• LDQBD

This page was built for publication: Cartesian product partitioning of multi-dimensional reachable state spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358087)