Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism

DOI10.1007/s10626-023-00375-xarXiv2201.07474OpenAlexW4387781033MaRDI QIDQ6201390

Albert Benveniste, Jean-Baptiste Raclet

Publication date: 25 March 2024

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.07474

zbMATH Keywords

Bayesian networkssemanticsprobabilistic programmingprobabilistic automatafactor graphsnondeterminism and probability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantic domains for combining probability and non-determinism
• Abstract probabilistic automata
• Fusion, propagation, and structuring in belief networks
• Model-based testing of probabilistic systems
• Equivalence notions and model minimization in Markov decision processes
• Semantics of probabilistic programs
• A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems
• Synchronization of Bernoulli sequences on shared letters
• A denotational semantics for low-level probabilistic programs with nondeterminism
• Markovian dynamics of concurrent systems
• Bayesian network semantics for Petri nets
• True-concurrency probabilistic models: Markov nets and a law of large numbers
• True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
• Markov two-components processes
• Stochastic non-determinism and effectivity functions
• Markov Random Fields and Their Applications
• Bisimulation Metrics for Continuous Markov Decision Processes
• Bisimulations for non-deterministic labelled Markov processes
• Understanding Probabilistic Programs
• Relational Reasoning via Probabilistic Coupling
• Concurrency, σ-Algebras, and Probabilistic Fairness
• Semantics for probabilistic programming
• Abstraction, Refinement and Proof for Probabilistic Systems
• Validation of Stochastic Systems
• Testing Statistical Hypotheses
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
• Probability and Nondeterminism in Operational Models of Concurrency
• Measure Transformer Semantics for Bayesian Machine Learning
• CONCUR 2003 - Concurrency Theory
• Conditioning in probabilistic programming

This page was built for publication: Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism