A theory of distributed Markov chains

DOI10.3233/FI-2020-1958MaRDI QIDQ4988963zbMATH OpenFDO

Authors P. S. Thiagarajan, Shaofa Yang

Publication date 20 May 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2020-1958

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Distributed Markov chains
• The how and why of interactive Markov chains
• Approximate verification of the symbolic dynamics of Markov chains
• Approximate verification of the symbolic dynamics of Markov chains
• Constraint Markov chains

Cites work

• A technique of state space search based on unfolding
• Concurrency, σ-Algebras, and Probabilistic Fairness
• Free Choice Petri Nets
• scientific article; zbMATH DE number 4018370 (Why is no real title available?)
• scientific article; zbMATH DE number 5819433 (Why is no real title available?)
• scientific article; zbMATH DE number 4031000 (Why is no real title available?)
• scientific article; zbMATH DE number 2059843 (Why is no real title available?)
• scientific article; zbMATH DE number 1864590 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Model checking
• Model checking probabilistic systems
• Partial Order Reduction for Markov Decision Processes: A Survey
• Petri nets, event structures and domains. I
• Probabilistic asynchronous automata
• Probabilistic event structures and domains
• Reachability in cyclic extended free-choice systems
• Syntactic partial order compression for probabilistic reachability
• The 10,000 facets of MDP model checking
• True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
• True-concurrency probabilistic models: Markov nets and a law of large numbers

Cited in

(7)

• Markov two-components processes
• scientific article; zbMATH DE number 2134052 (Why is no real title available?)
• Markov chains competing for transitions: application to large-scale distributed systems
• Distributed Averaging Via Lifted Markov Chains
• Distributed Markov chains
• Causally deterministic Markov decision processes
• Large deviations analysis for distributed algorithms in an ergodic Markovian environment

Describes a project that uses

Uses Software

• PRISM

This page was built for publication: A theory of distributed Markov chains

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