Constraint Markov chains
The article introduces constraint Markov chains as a new tool for specification. They are a generalization of interval Markov chains. Interval Markov chains extend Markov chains by labeling transitions with intervals, implying that each transition probability needs to be within the according interval. In constraint Markov chains these intervals are replaced by arbitrary constraints. This increases flexibility at the cost of increased complexity. The authors discuss operations on such constraint Markov chains including refinement, parallel composition, conjunction, and tests for consistency and satisfaction. They provide clear and proven statements concentrating on closure properties and complexity of algorithms for these operations. While interval Markov chains are not even closed under conjunction, constraint Markov chains with linear constraints are. Moreover, constraint Markov chains with polynomial constraints are proven be to sufficient for closure for conjunction and parallel composition. Special cases like deterministic constraint Markov chains and connections to probabilistic automata are discussed. The article is to a large degree self-contained. The presentation is clear and precise. Many small examples make the material accessible.
- A logic for reasoning about time and reliability
- Automated Technology for Verification and Analysis
- Compositional abstraction for stochastic systems
- Frontiers of Combining Systems
- scientific article; zbMATH DE number 1348599 (Why is no real title available?)
- scientific article; zbMATH DE number 1863173 (Why is no real title available?)
- Interactive Markov chains. And the quest for quantified quality
- Markov set-chains
- Markov Set-Chains as Abstractions of Stochastic Hybrid Systems
- Methodologies for specification of real-time systems using timed I/O automata
- Modal I/O Automata for Interface and Product Line Theories
- Model Checking Software
- Model-Checking ω-Regular Properties of Interval Markov Chains
- New results on quantifier elimination over real closed fields and applications to constraint databases
- On determinism in modal transition systems
- On Modal Refinement and Consistency
- Probabilistic CEGAR
- Probabilistic extensions of process algebras.
- Process algebra for performance evaluation
- Refinement and Consistency of Timed Modal Specifications
- Simple CAD construction and its applications
- Symbolic model checking for probabilistic timed automata
- Synchronous and Bidirectional Component Interfaces
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Timed I/O automata: a complete specification theory for real-time systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Validation of Stochastic Systems
- Validation of Stochastic Systems
- Opacity for linear constraint Markov chains
- Compositionality for quantitative specifications
- Stuttering for abstract probabilistic automata
- Smoothed model checking for uncertain continuous-time Markov chains
- Stuttering for abstract probabilistic automata
- scientific article; zbMATH DE number 3925922 (Why is no real title available?)
- Abstract probabilistic automata
- Maximizing entropy over Markov processes
- A theory of distributed Markov chains
- Introducing User-Prescribed Constraints in Markov Chains for Nonlinear Dimensionality Reduction
- Consistency for parametric interval Markov chains
- The Markov Transition Constraint
- Approximate verification of the symbolic dynamics of Markov chains
- Policy Synthesis for Collective Dynamics
- Assume-guarantee reasoning for additive hybrid behaviour
- Lumpability for uncertain continuous-time Markov chains
This page was built for publication: Constraint Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554215)
