A Theory of Distributed Markov Chains

DOI10.3233/FI-2020-1958zbMath1497.68353MaRDI QIDQ4988963

P. S. Thiagarajan, Shaofa Yang

Publication date: 20 May 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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)

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability in cyclic extended free-choice systems
• Petri nets, event structures and domains. I
• A technique of state space search based on unfolding
• The 10,000 facets of MDP model checking
• Syntactic partial order compression for probabilistic reachability
• True-concurrency probabilistic models: Markov nets and a law of large numbers
• True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
• Probabilistic event structures and domains
• Model Checking Probabilistic Systems
• Partial Order Reduction for Markov Decision Processes: A Survey
• Concurrency, σ-Algebras, and Probabilistic Fairness
• Free Choice Petri Nets
• Probabilistic asynchronous automata

This page was built for publication: A Theory of Distributed Markov Chains